./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:17:17,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:17:17,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:17:17,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:17:17,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:17:17,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:17:17,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:17:17,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:17:17,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:17:17,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:17:17,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:17:17,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:17:17,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:17:17,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:17:17,482 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:17:17,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:17:17,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:17:17,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:17:17,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:17:17,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:17:17,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:17:17,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:17:17,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:17:17,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:17:17,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:17:17,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:17:17,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:17:17,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:17:17,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:17:17,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:17:17,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:17:17,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:17:17,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:17:17,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:17:17,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:17:17,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:17:17,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:17:17,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:17:17,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:17:17,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:17:17,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:17:17,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:17:17,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:17:17,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:17:17,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:17:17,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:17:17,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:17:17,780 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:17:17,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-15 15:17:19,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:17:19,484 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:17:19,484 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-15 15:17:19,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/2b212eda7/1587818d97c644d2b1d866f6f139a96d/FLAG1559c23bb [2024-10-15 15:17:19,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/2b212eda7/1587818d97c644d2b1d866f6f139a96d [2024-10-15 15:17:19,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:17:19,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:17:19,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:17:19,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:17:19,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:17:19,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:17:19" (1/1) ... [2024-10-15 15:17:19,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d2871f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:19, skipping insertion in model container [2024-10-15 15:17:19,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:17:19" (1/1) ... [2024-10-15 15:17:19,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:17:20,082 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-10-15 15:17:20,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:17:20,097 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:17:20,113 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-10-15 15:17:20,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:17:20,131 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:17:20,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20 WrapperNode [2024-10-15 15:17:20,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:17:20,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:17:20,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:17:20,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:17:20,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,154 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:17:20,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:17:20,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:17:20,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:17:20,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:17:20,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,186 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-10-15 15:17:20,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:17:20,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:17:20,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:17:20,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:17:20,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (1/1) ... [2024-10-15 15:17:20,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:17:20,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:20,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 15:17:20,245 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 15:17:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:17:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:17:20,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:17:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 15:17:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:17:20,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:17:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-10-15 15:17:20,288 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-10-15 15:17:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:17:20,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:17:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:17:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:17:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 15:17:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-10-15 15:17:20,288 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-10-15 15:17:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:17:20,355 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:17:20,357 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:17:20,512 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 15:17:20,513 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:17:20,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:17:20,538 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:17:20,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:17:20 BoogieIcfgContainer [2024-10-15 15:17:20,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:17:20,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:17:20,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:17:20,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:17:20,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:17:19" (1/3) ... [2024-10-15 15:17:20,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b19069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:17:20, skipping insertion in model container [2024-10-15 15:17:20,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:17:20" (2/3) ... [2024-10-15 15:17:20,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b19069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:17:20, skipping insertion in model container [2024-10-15 15:17:20,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:17:20" (3/3) ... [2024-10-15 15:17:20,551 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-10-15 15:17:20,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:17:20,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:17:20,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:17:20,648 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3112f5d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:17:20,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:17:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-15 15:17:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 15:17:20,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:20,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:20,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:20,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1880927793, now seen corresponding path program 1 times [2024-10-15 15:17:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173852084] [2024-10-15 15:17:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:17:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173852084] [2024-10-15 15:17:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173852084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:17:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:17:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 15:17:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507435142] [2024-10-15 15:17:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:17:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 15:17:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 15:17:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:17:21,295 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:17:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:21,449 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-10-15 15:17:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:17:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-15 15:17:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:21,461 INFO L225 Difference]: With dead ends: 40 [2024-10-15 15:17:21,461 INFO L226 Difference]: Without dead ends: 27 [2024-10-15 15:17:21,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 15:17:21,468 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:21,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:17:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-15 15:17:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-10-15 15:17:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 15:17:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-15 15:17:21,501 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2024-10-15 15:17:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:21,501 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-15 15:17:21,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:17:21,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-15 15:17:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-15 15:17:21,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:21,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:21,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:17:21,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:21,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash 259605890, now seen corresponding path program 1 times [2024-10-15 15:17:21,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4096801] [2024-10-15 15:17:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-15 15:17:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 15:17:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4096801] [2024-10-15 15:17:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4096801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:17:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:17:21,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 15:17:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306141517] [2024-10-15 15:17:21,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:17:21,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 15:17:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 15:17:21,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:17:21,829 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 15:17:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:21,945 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-10-15 15:17:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 15:17:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-10-15 15:17:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:21,948 INFO L225 Difference]: With dead ends: 46 [2024-10-15 15:17:21,948 INFO L226 Difference]: Without dead ends: 27 [2024-10-15 15:17:21,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-15 15:17:21,950 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:21,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:17:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-15 15:17:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-15 15:17:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-15 15:17:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-15 15:17:21,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 25 [2024-10-15 15:17:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:21,966 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-15 15:17:21,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 15:17:21,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-15 15:17:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-15 15:17:21,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:21,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:21,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 15:17:21,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:21,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 889705653, now seen corresponding path program 1 times [2024-10-15 15:17:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:21,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128166157] [2024-10-15 15:17:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 15:17:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 15:17:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128166157] [2024-10-15 15:17:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128166157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108655757] [2024-10-15 15:17:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:22,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:22,616 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:17:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:22,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-15 15:17:22,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:22,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:22,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-15 15:17:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 15:17:22,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 15:17:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108655757] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:17:23,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:17:23,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-10-15 15:17:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324293657] [2024-10-15 15:17:23,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:23,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-15 15:17:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 15:17:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-10-15 15:17:23,557 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-15 15:17:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:23,816 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-15 15:17:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 15:17:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) Word has length 30 [2024-10-15 15:17:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:23,819 INFO L225 Difference]: With dead ends: 50 [2024-10-15 15:17:23,819 INFO L226 Difference]: Without dead ends: 29 [2024-10-15 15:17:23,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-10-15 15:17:23,821 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:23,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 109 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-15 15:17:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-15 15:17:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-15 15:17:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-15 15:17:23,830 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 30 [2024-10-15 15:17:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:23,830 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-15 15:17:23,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-15 15:17:23,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-15 15:17:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-15 15:17:23,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:23,832 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:23,849 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:17:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:24,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1706437626, now seen corresponding path program 2 times [2024-10-15 15:17:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201306504] [2024-10-15 15:17:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-15 15:17:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-15 15:17:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201306504] [2024-10-15 15:17:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201306504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549770487] [2024-10-15 15:17:24,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:17:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:24,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:24,715 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:17:24,791 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:17:24,791 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:24,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-15 15:17:24,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:24,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-15 15:17:24,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-15 15:17:25,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549770487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:17:25,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:17:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-10-15 15:17:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714755831] [2024-10-15 15:17:25,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:25,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-15 15:17:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-15 15:17:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-10-15 15:17:25,397 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-15 15:17:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:25,770 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-10-15 15:17:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 15:17:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 35 [2024-10-15 15:17:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:25,773 INFO L225 Difference]: With dead ends: 56 [2024-10-15 15:17:25,773 INFO L226 Difference]: Without dead ends: 33 [2024-10-15 15:17:25,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2024-10-15 15:17:25,775 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:25,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 87 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-15 15:17:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-15 15:17:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-15 15:17:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-15 15:17:25,784 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2024-10-15 15:17:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:25,788 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-15 15:17:25,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-15 15:17:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-15 15:17:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-15 15:17:25,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:25,790 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:25,812 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 15:17:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:25,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1700016267, now seen corresponding path program 3 times [2024-10-15 15:17:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174061695] [2024-10-15 15:17:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:17:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:17:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-15 15:17:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174061695] [2024-10-15 15:17:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174061695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808628187] [2024-10-15 15:17:27,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:17:27,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:27,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:27,173 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:17:27,261 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-15 15:17:27,261 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:27,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-15 15:17:27,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:27,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-15 15:17:27,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-15 15:17:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808628187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:17:28,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:17:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2024-10-15 15:17:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904600587] [2024-10-15 15:17:28,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:28,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-15 15:17:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-15 15:17:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2024-10-15 15:17:28,346 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-15 15:17:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:28,849 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2024-10-15 15:17:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 15:17:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) Word has length 66 [2024-10-15 15:17:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:28,851 INFO L225 Difference]: With dead ends: 64 [2024-10-15 15:17:28,851 INFO L226 Difference]: Without dead ends: 37 [2024-10-15 15:17:28,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1694, Unknown=0, NotChecked=0, Total=1980 [2024-10-15 15:17:28,853 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:28,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-15 15:17:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-15 15:17:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-15 15:17:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-15 15:17:28,867 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 66 [2024-10-15 15:17:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:28,867 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-15 15:17:28,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-15 15:17:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-15 15:17:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-15 15:17:28,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:28,873 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:28,886 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 15:17:29,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:29,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash -515831498, now seen corresponding path program 4 times [2024-10-15 15:17:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768309255] [2024-10-15 15:17:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:29,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 15:17:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 15:17:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 15:17:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 12 proven. 212 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-10-15 15:17:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768309255] [2024-10-15 15:17:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768309255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127795923] [2024-10-15 15:17:30,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 15:17:30,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:30,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:30,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:30,767 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 15:17:30,902 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 15:17:30,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:30,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-15 15:17:30,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:30,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:31,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-15 15:17:31,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-15 15:17:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-15 15:17:31,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:31,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-15 15:17:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127795923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:31,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:17:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-10-15 15:17:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839957166] [2024-10-15 15:17:31,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 15:17:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 15:17:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2024-10-15 15:17:31,869 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2024-10-15 15:17:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:32,297 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-10-15 15:17:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 15:17:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) Word has length 107 [2024-10-15 15:17:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:32,302 INFO L225 Difference]: With dead ends: 75 [2024-10-15 15:17:32,302 INFO L226 Difference]: Without dead ends: 44 [2024-10-15 15:17:32,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2024-10-15 15:17:32,304 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:32,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-15 15:17:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-15 15:17:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 12 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 15:17:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-15 15:17:32,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 107 [2024-10-15 15:17:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:32,320 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-15 15:17:32,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2024-10-15 15:17:32,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-15 15:17:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-15 15:17:32,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:32,322 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:32,342 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 15:17:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:32,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -313299501, now seen corresponding path program 1 times [2024-10-15 15:17:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882880978] [2024-10-15 15:17:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 15:17:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 15:17:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 15:17:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-10-15 15:17:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882880978] [2024-10-15 15:17:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882880978] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424029408] [2024-10-15 15:17:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:34,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:34,678 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 15:17:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:34,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-15 15:17:34,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:34,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-10-15 15:17:35,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2024-10-15 15:17:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424029408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:17:36,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:17:36,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 41 [2024-10-15 15:17:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037660807] [2024-10-15 15:17:36,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:36,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-15 15:17:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-15 15:17:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 15:17:36,295 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) [2024-10-15 15:17:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:36,818 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-10-15 15:17:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-15 15:17:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) Word has length 122 [2024-10-15 15:17:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:36,826 INFO L225 Difference]: With dead ends: 80 [2024-10-15 15:17:36,826 INFO L226 Difference]: Without dead ends: 43 [2024-10-15 15:17:36,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=2456, Unknown=0, NotChecked=0, Total=2862 [2024-10-15 15:17:36,828 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 178 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-15 15:17:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-15 15:17:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 15:17:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-10-15 15:17:36,847 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 122 [2024-10-15 15:17:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:36,848 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-10-15 15:17:36,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) [2024-10-15 15:17:36,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-10-15 15:17:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-15 15:17:36,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:36,850 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 15:17:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 15:17:37,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash -525253801, now seen corresponding path program 5 times [2024-10-15 15:17:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236072146] [2024-10-15 15:17:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:37,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:37,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2024-10-15 15:17:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236072146] [2024-10-15 15:17:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236072146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717224694] [2024-10-15 15:17:39,726 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 15:17:39,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:39,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:39,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:39,730 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 15:17:40,480 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-10-15 15:17:40,480 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:40,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-15 15:17:40,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:40,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:40,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-15 15:17:40,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-15 15:17:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2024-10-15 15:17:40,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:41,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-15 15:17:41,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717224694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:41,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:17:41,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2024-10-15 15:17:41,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889977461] [2024-10-15 15:17:41,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:41,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-15 15:17:41,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:41,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-15 15:17:41,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-10-15 15:17:41,394 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-15 15:17:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:41,669 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-10-15 15:17:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 15:17:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) Word has length 178 [2024-10-15 15:17:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:41,671 INFO L225 Difference]: With dead ends: 58 [2024-10-15 15:17:41,671 INFO L226 Difference]: Without dead ends: 55 [2024-10-15 15:17:41,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2024-10-15 15:17:41,674 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:41,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-15 15:17:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-15 15:17:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (19), 16 states have call predecessors, (19), 5 states have call successors, (19) [2024-10-15 15:17:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-10-15 15:17:41,691 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 178 [2024-10-15 15:17:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:41,692 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-15 15:17:41,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-15 15:17:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-10-15 15:17:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-15 15:17:41,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:41,697 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:41,716 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 15:17:41,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:41,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:41,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash -525251879, now seen corresponding path program 2 times [2024-10-15 15:17:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:41,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867893134] [2024-10-15 15:17:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2024-10-15 15:17:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867893134] [2024-10-15 15:17:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867893134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750613954] [2024-10-15 15:17:44,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:17:44,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:44,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:44,392 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 15:17:44,624 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:17:44,625 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:44,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-15 15:17:44,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:44,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 15:17:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-10-15 15:17:44,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-10-15 15:17:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750613954] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:17:46,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:17:46,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 42 [2024-10-15 15:17:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87766200] [2024-10-15 15:17:46,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:17:46,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-15 15:17:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:17:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-15 15:17:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2024-10-15 15:17:46,447 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-10-15 15:17:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:46,812 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-10-15 15:17:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 15:17:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) Word has length 178 [2024-10-15 15:17:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:46,814 INFO L225 Difference]: With dead ends: 52 [2024-10-15 15:17:46,814 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 15:17:46,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 395 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=444, Invalid=2006, Unknown=0, NotChecked=0, Total=2450 [2024-10-15 15:17:46,816 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:46,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 178 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:17:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 15:17:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-15 15:17:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (17), 15 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-15 15:17:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-10-15 15:17:46,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 178 [2024-10-15 15:17:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:46,826 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-10-15 15:17:46,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-10-15 15:17:46,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-10-15 15:17:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-15 15:17:46,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:46,829 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:17:46,847 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 15:17:47,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:47,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1830036763, now seen corresponding path program 6 times [2024-10-15 15:17:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856792550] [2024-10-15 15:17:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:17:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 937 proven. 34 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2024-10-15 15:17:50,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:50,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856792550] [2024-10-15 15:17:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856792550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:50,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887952123] [2024-10-15 15:17:50,778 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 15:17:50,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:50,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:50,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:17:50,782 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 15:17:57,884 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2024-10-15 15:17:57,885 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:57,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-10-15 15:17:57,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:57,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 15:17:58,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-15 15:17:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1171 proven. 81 refuted. 0 times theorem prover too weak. 2951 trivial. 0 not checked. [2024-10-15 15:17:58,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:17:59,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-15 15:17:59,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-15 15:18:00,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-15 15:18:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-15 15:18:00,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-15 15:18:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887952123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:18:01,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:18:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 25 [2024-10-15 15:18:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900725916] [2024-10-15 15:18:01,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:18:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-15 15:18:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:18:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 15:18:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2024-10-15 15:18:01,335 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-15 15:18:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:18:01,793 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-10-15 15:18:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 15:18:01,794 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 260 [2024-10-15 15:18:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:18:01,795 INFO L225 Difference]: With dead ends: 52 [2024-10-15 15:18:01,795 INFO L226 Difference]: Without dead ends: 49 [2024-10-15 15:18:01,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2024-10-15 15:18:01,796 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:18:01,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 226 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:18:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-15 15:18:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-10-15 15:18:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (17), 15 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-15 15:18:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-15 15:18:01,813 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 260 [2024-10-15 15:18:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:18:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-15 15:18:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-15 15:18:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:18:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-15 15:18:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-15 15:18:01,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:18:01,819 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:18:01,849 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-15 15:18:02,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:18:02,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:18:02,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:18:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1830038685, now seen corresponding path program 3 times [2024-10-15 15:18:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:18:02,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952987968] [2024-10-15 15:18:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:18:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:18:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:18:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:18:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:02,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:18:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:18:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:18:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:18:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:18:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:18:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:18:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 4165 trivial. 0 not checked. [2024-10-15 15:18:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:18:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952987968] [2024-10-15 15:18:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952987968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:18:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894869765] [2024-10-15 15:18:04,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:18:04,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:18:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:18:04,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:18:04,415 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 15:18:07,337 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2024-10-15 15:18:07,337 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:18:07,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-15 15:18:07,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:18:07,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-15 15:18:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1186 proven. 18 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2024-10-15 15:18:07,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:18:08,521 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-15 15:18:08,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-15 15:18:08,865 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-15 15:18:08,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-15 15:18:09,121 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-15 15:18:09,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-15 15:18:09,309 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-15 15:18:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-15 15:18:09,461 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-15 15:18:09,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-15 15:18:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 4159 trivial. 0 not checked. [2024-10-15 15:18:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894869765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:18:18,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:18:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 26 [2024-10-15 15:18:18,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104148308] [2024-10-15 15:18:18,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:18:18,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-15 15:18:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:18:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-15 15:18:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=565, Unknown=2, NotChecked=0, Total=650 [2024-10-15 15:18:18,286 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-15 15:18:22,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:18:22,659 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-15 15:18:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 15:18:22,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 260 [2024-10-15 15:18:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:18:22,660 INFO L225 Difference]: With dead ends: 51 [2024-10-15 15:18:22,660 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:18:22,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 607 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=176, Invalid=1012, Unknown=2, NotChecked=0, Total=1190 [2024-10-15 15:18:22,661 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:18:22,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 60 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 327 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2024-10-15 15:18:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:18:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:18:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 15:18:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:18:22,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2024-10-15 15:18:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:18:22,663 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:18:22,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-15 15:18:22,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:18:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:18:22,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:18:22,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:18:22,685 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-15 15:18:22,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-15 15:18:22,870 INFO L407 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1] [2024-10-15 15:18:22,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:18:24,303 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:18:24,310 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) [2024-10-15 15:18:24,321 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,321 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-15 15:18:24,325 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:18:24,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 15:18:24,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-15 15:18:24,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-15 15:18:24,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-15 15:18:24,330 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-10-15 15:18:24,332 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67|) 5))) Eliminated clause: (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67|) 5)) [2024-10-15 15:18:24,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-15 15:18:24,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-15 15:18:24,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-15 15:18:24,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-15 15:18:24,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-15 15:18:24,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:18:24,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-15 15:18:24,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:18:24 BoogieIcfgContainer [2024-10-15 15:18:24,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 15:18:24,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 15:18:24,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 15:18:24,345 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 15:18:24,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:17:20" (3/4) ... [2024-10-15 15:18:24,347 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 15:18:24,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 15:18:24,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 15:18:24,400 INFO L158 Benchmark]: Toolchain (without parser) took 64533.96ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.1MB in the beginning and 859.1MB in the end (delta: -739.9MB). Peak memory consumption was 297.1MB. Max. memory is 16.1GB. [2024-10-15 15:18:24,400 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:18:24,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 106.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:18:24,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.24ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 105.6MB in the end (delta: 969.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:18:24,401 INFO L158 Benchmark]: Boogie Preprocessor took 49.01ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 104.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:18:24,402 INFO L158 Benchmark]: RCFGBuilder took 333.27ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 89.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 15:18:24,402 INFO L158 Benchmark]: TraceAbstraction took 63802.51ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 89.3MB in the beginning and 861.2MB in the end (delta: -771.8MB). Peak memory consumption was 265.6MB. Max. memory is 16.1GB. [2024-10-15 15:18:24,403 INFO L158 Benchmark]: Witness Printer took 54.92ms. Allocated memory is still 1.2GB. Free memory was 861.2MB in the beginning and 859.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:18:24,404 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 106.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.24ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 105.6MB in the end (delta: 969.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.01ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 104.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.27ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 89.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 63802.51ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 89.3MB in the beginning and 861.2MB in the end (delta: -771.8MB). Peak memory consumption was 265.6MB. Max. memory is 16.1GB. * Witness Printer took 54.92ms. Allocated memory is still 1.2GB. Free memory was 861.2MB in the beginning and 859.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.3s, OverallIterations: 11, TraceHistogramMax: 42, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 1292 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1121 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3090 IncrementalHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 171 mSDtfsCounter, 3090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2671 GetRequests, 2301 SyntacticMatches, 7 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3851 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=8, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 10.7s SatisfiabilityAnalysisTime, 40.2s InterpolantComputationTime, 2511 NumberOfCodeBlocks, 2458 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3176 ConstructedInterpolants, 38 QuantifiedInterpolants, 10781 SizeOfPredicates, 107 NumberOfNonLiveVariables, 5010 ConjunctsInSsa, 525 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 32994/34038 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-15 15:18:24,449 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE