./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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_nla-digbench/recursified_lcm2.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 d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:39:07,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:39:07,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:39:07,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:39:07,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:39:07,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:39:07,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:39:07,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:39:07,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:39:07,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:39:07,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:39:07,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:39:07,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:39:07,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:39:07,125 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:39:07,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:39:07,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:39:07,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:39:07,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:39:07,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:39:07,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:39:07,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:39:07,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:39:07,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:39:07,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:39:07,130 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:39:07,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:39:07,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:39:07,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:39:07,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:39:07,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:39:07,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:39:07,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:39:07,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:39:07,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:39:07,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:39:07,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:39:07,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:39:07,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:39:07,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:39:07,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:39:07,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:39:07,137 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 -> d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 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 [2024-09-11 20:39:07,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:39:07,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:39:07,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:39:07,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:39:07,422 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:39:07,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-09-11 20:39:08,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:39:08,956 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:39:08,956 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-09-11 20:39:08,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/270e429a9/969b2dbbae8b48a48f901dad7ba5e5fe/FLAG791d0e708 [2024-09-11 20:39:09,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/270e429a9/969b2dbbae8b48a48f901dad7ba5e5fe [2024-09-11 20:39:09,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:39:09,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:39:09,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:39:09,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:39:09,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:39:09,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6275175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09, skipping insertion in model container [2024-09-11 20:39:09,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:39:09,539 WARN L247 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_nla-digbench/recursified_lcm2.c[1061,1074] [2024-09-11 20:39:09,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:39:09,564 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:39:09,576 WARN L247 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_nla-digbench/recursified_lcm2.c[1061,1074] [2024-09-11 20:39:09,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:39:09,609 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:39:09,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09 WrapperNode [2024-09-11 20:39:09,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:39:09,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:39:09,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:39:09,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:39:09,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,638 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2024-09-11 20:39:09,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:39:09,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:39:09,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:39:09,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:39:09,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,671 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 7, 7, 7, 6, 6, 8, 8]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 1, 1, 2, 2, 2, 2]. [2024-09-11 20:39:09,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:39:09,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:39:09,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:39:09,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:39:09,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (1/1) ... [2024-09-11 20:39:09,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:39:09,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:39:09,720 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-09-11 20:39:09,723 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-09-11 20:39:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:39:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:39:09,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:39:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:39:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:39:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-11 20:39:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-11 20:39:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-11 20:39:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:39:09,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 20:39:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-11 20:39:09,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-11 20:39:09,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-11 20:39:09,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-11 20:39:09,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-11 20:39:09,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-11 20:39:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:39:09,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:39:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 20:39:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2024-09-11 20:39:09,776 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2024-09-11 20:39:09,880 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:39:09,884 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:39:10,178 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-11 20:39:10,178 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:39:10,216 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:39:10,217 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 20:39:10,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:39:10 BoogieIcfgContainer [2024-09-11 20:39:10,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:39:10,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:39:10,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:39:10,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:39:10,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:39:09" (1/3) ... [2024-09-11 20:39:10,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6fe68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:39:10, skipping insertion in model container [2024-09-11 20:39:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:39:09" (2/3) ... [2024-09-11 20:39:10,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6fe68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:39:10, skipping insertion in model container [2024-09-11 20:39:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:39:10" (3/3) ... [2024-09-11 20:39:10,225 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2024-09-11 20:39:10,240 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:39:10,240 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:39:10,305 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:39:10,311 INFO L336 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;@34b11913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:39:10,311 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:39:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:39:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 20:39:10,322 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:39:10,323 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:39:10,323 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:39:10,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash 897324978, now seen corresponding path program 1 times [2024-09-11 20:39:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:39:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577729755] [2024-09-11 20:39:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:39:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:10,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:39:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:10,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:39:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:10,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 20:39:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:10,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:39:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:39:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:39:10,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577729755] [2024-09-11 20:39:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577729755] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:39:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:39:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:39:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721960897] [2024-09-11 20:39:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:39:10,604 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:39:10,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:39:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:39:10,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:39:10,629 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:39:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:39:10,666 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2024-09-11 20:39:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:39:10,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-09-11 20:39:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:39:10,675 INFO L225 Difference]: With dead ends: 64 [2024-09-11 20:39:10,675 INFO L226 Difference]: Without dead ends: 31 [2024-09-11 20:39:10,679 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:39:10,682 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:39:10,685 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:39:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-11 20:39:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-11 20:39:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:39:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-11 20:39:10,723 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 32 [2024-09-11 20:39:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:39:10,724 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-11 20:39:10,724 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:39:10,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-11 20:39:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 20:39:10,727 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:39:10,727 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:39:10,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:39:10,728 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:39:10,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash -409193286, now seen corresponding path program 1 times [2024-09-11 20:39:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:39:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151574544] [2024-09-11 20:39:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:39:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:39:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164964148] [2024-09-11 20:39:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:39:10,865 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-09-11 20:39:10,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:39:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:11,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-09-11 20:39:11,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:39:11,214 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-09-11 20:39:11,218 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-09-11 20:39:11,244 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 11 [2024-09-11 20:39:11,255 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 11 [2024-09-11 20:39:11,264 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 11 [2024-09-11 20:39:11,273 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 11 [2024-09-11 20:39:11,463 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 30 treesize of output 18 [2024-09-11 20:39:11,469 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 19 treesize of output 11 [2024-09-11 20:39:11,473 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 22 treesize of output 10 [2024-09-11 20:39:11,486 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 19 treesize of output 11 [2024-09-11 20:39:11,495 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 26 treesize of output 14 [2024-09-11 20:39:11,501 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 22 treesize of output 10 [2024-09-11 20:39:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:39:11,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:39:11,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:39:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151574544] [2024-09-11 20:39:11,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:39:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164964148] [2024-09-11 20:39:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164964148] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:39:11,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:39:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 20:39:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900292859] [2024-09-11 20:39:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:39:11,570 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:39:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:39:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:39:11,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:39:11,571 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 20:39:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:39:11,881 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-09-11 20:39:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:39:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-11 20:39:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:39:11,884 INFO L225 Difference]: With dead ends: 46 [2024-09-11 20:39:11,884 INFO L226 Difference]: Without dead ends: 44 [2024-09-11 20:39:11,884 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:39:11,886 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:39:11,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:39:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-11 20:39:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-09-11 20:39:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-11 20:39:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-09-11 20:39:11,907 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 32 [2024-09-11 20:39:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:39:11,907 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-09-11 20:39:11,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 20:39:11,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-09-11 20:39:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-11 20:39:11,912 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:39:11,912 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:39:11,923 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:39:12,113 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:12,113 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:39:12,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1459834226, now seen corresponding path program 1 times [2024-09-11 20:39:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:39:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008219057] [2024-09-11 20:39:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:39:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:39:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917001745] [2024-09-11 20:39:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:39:12,205 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-09-11 20:39:12,207 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:39:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:12,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-09-11 20:39:12,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:39:12,488 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-09-11 20:39:12,494 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-09-11 20:39:12,512 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 11 [2024-09-11 20:39:12,520 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 11 [2024-09-11 20:39:12,527 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 11 [2024-09-11 20:39:12,539 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 11 [2024-09-11 20:39:12,582 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 11 treesize of output 7 [2024-09-11 20:39:12,587 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 11 treesize of output 7 [2024-09-11 20:39:12,598 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 11 treesize of output 7 [2024-09-11 20:39:12,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 11 treesize of output 7 [2024-09-11 20:39:12,791 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 19 treesize of output 11 [2024-09-11 20:39:12,799 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 19 treesize of output 11 [2024-09-11 20:39:12,804 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 22 treesize of output 10 [2024-09-11 20:39:12,813 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 30 treesize of output 18 [2024-09-11 20:39:12,821 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 19 treesize of output 11 [2024-09-11 20:39:12,825 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 22 treesize of output 10 [2024-09-11 20:39:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:39:12,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:39:12,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:39:12,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008219057] [2024-09-11 20:39:12,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:39:12,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917001745] [2024-09-11 20:39:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917001745] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:39:12,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:39:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 20:39:12,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521616373] [2024-09-11 20:39:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:39:12,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:39:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:39:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:39:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:39:12,879 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:39:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:39:13,121 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-09-11 20:39:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:39:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-09-11 20:39:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:39:13,125 INFO L225 Difference]: With dead ends: 52 [2024-09-11 20:39:13,126 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 20:39:13,127 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:39:13,128 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:39:13,131 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:39:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 20:39:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 20:39:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-11 20:39:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-09-11 20:39:13,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 42 [2024-09-11 20:39:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:39:13,144 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-09-11 20:39:13,145 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:39:13,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-09-11 20:39:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-11 20:39:13,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:39:13,146 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2024-09-11 20:39:13,155 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:39:13,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:13,351 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:39:13,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash 44848769, now seen corresponding path program 1 times [2024-09-11 20:39:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:39:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419681078] [2024-09-11 20:39:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:39:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:39:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068895507] [2024-09-11 20:39:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:13,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:13,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:39:13,464 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-09-11 20:39:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:39:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:13,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 167 conjuncts are in the unsatisfiable core [2024-09-11 20:39:13,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:39:13,933 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-09-11 20:39:13,936 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-09-11 20:39:13,950 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 11 [2024-09-11 20:39:13,954 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 11 [2024-09-11 20:39:13,961 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 11 [2024-09-11 20:39:13,967 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 11 [2024-09-11 20:39:18,099 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#2| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1))) (and (= (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1) .cse0) (= (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1) .cse0)))) (exists ((v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1))) (and (= .cse1 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1)) (= .cse1 (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1)))))) is different from true [2024-09-11 20:39:18,269 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 33 treesize of output 21 [2024-09-11 20:39:18,278 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 35 treesize of output 21 [2024-09-11 20:39:18,386 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 42 treesize of output 30 [2024-09-11 20:39:18,399 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 41 treesize of output 29 [2024-09-11 20:39:18,407 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 30 treesize of output 22 [2024-09-11 20:39:18,414 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 44 treesize of output 28 [2024-09-11 20:39:18,422 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 42 treesize of output 26 [2024-09-11 20:39:18,427 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 26 treesize of output 14 [2024-09-11 20:39:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2024-09-11 20:39:18,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:39:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 20:39:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:39:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419681078] [2024-09-11 20:39:21,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:39:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068895507] [2024-09-11 20:39:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068895507] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:39:21,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:39:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2024-09-11 20:39:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533115632] [2024-09-11 20:39:21,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:39:21,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:39:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:39:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:39:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2024-09-11 20:39:21,041 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 15 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:39:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:39:36,637 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-09-11 20:39:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:39:36,637 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-09-11 20:39:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:39:36,639 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:39:36,639 INFO L226 Difference]: Without dead ends: 58 [2024-09-11 20:39:36,639 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=4, NotChecked=42, Total=552 [2024-09-11 20:39:36,640 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:39:36,640 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 251 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 265 Invalid, 0 Unknown, 68 Unchecked, 2.4s Time] [2024-09-11 20:39:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-11 20:39:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-09-11 20:39:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-11 20:39:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-09-11 20:39:36,669 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 43 [2024-09-11 20:39:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:39:36,672 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-09-11 20:39:36,672 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:39:36,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-09-11 20:39:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 20:39:36,674 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:39:36,674 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 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, 1, 1] [2024-09-11 20:39:36,683 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:39:36,875 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:36,875 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:39:36,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash 79448969, now seen corresponding path program 1 times [2024-09-11 20:39:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:39:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631672145] [2024-09-11 20:39:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:39:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:39:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161149607] [2024-09-11 20:39:37,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:37,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:37,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:39:37,008 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-09-11 20:39:37,009 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:39:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:37,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-09-11 20:39:37,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:39:37,468 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-09-11 20:39:37,470 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-09-11 20:39:37,475 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 11 [2024-09-11 20:39:37,480 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 11 [2024-09-11 20:39:37,486 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 11 [2024-09-11 20:39:37,493 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 11 [2024-09-11 20:39:37,516 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 11 treesize of output 7 [2024-09-11 20:39:37,519 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 11 treesize of output 7 [2024-09-11 20:39:37,526 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 11 treesize of output 7 [2024-09-11 20:39:37,530 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 11 treesize of output 7 [2024-09-11 20:39:38,591 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 20 treesize of output 9 [2024-09-11 20:39:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-09-11 20:39:38,609 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 33 treesize of output 21 [2024-09-11 20:39:38,989 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 49 treesize of output 41 [2024-09-11 20:39:39,000 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 56 treesize of output 44 [2024-09-11 20:39:39,010 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 63 treesize of output 43 [2024-09-11 20:39:39,020 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 54 treesize of output 42 [2024-09-11 20:39:39,025 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 53 treesize of output 37 [2024-09-11 20:39:39,030 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 55 treesize of output 35 [2024-09-11 20:39:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 20:39:39,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:39:48,814 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int)) (let ((.cse0 (* (mod (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648) 2))) (or (not (= (mod (+ (* (select (select |c_old(#memory_int#6)| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|) (select (select |c_old(#memory_int#5)| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|)) (* (select (select |c_old(#memory_int#4)| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|) (select (select |c_old(#memory_int#7)| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|))) 4294967296) .cse0)) (= (mod (+ (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|))) 4294967296) .cse0)))) (or (= (* 2 (mod (* (select (select |c_#memory_int#2| |c_func_to_recursive_line_35_to_46_0_#in~b.base|) |c_func_to_recursive_line_35_to_46_0_#in~b.offset|) (select (select |c_#memory_int#3| |c_func_to_recursive_line_35_to_46_0_#in~a.base|) |c_func_to_recursive_line_35_to_46_0_#in~a.offset|)) 2147483648)) (mod (+ (* (select (select |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~v.base|) |c_func_to_recursive_line_35_to_46_0_#in~v.offset|) (select (select |c_old(#memory_int#7)| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|)) (* (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|) (select (select |c_old(#memory_int#6)| |c_func_to_recursive_line_35_to_46_0_#in~x.base|) |c_func_to_recursive_line_35_to_46_0_#in~x.offset|))) 4294967296)) (forall ((|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int)) (= (mod (+ (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|))) 4294967296) (* (mod (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648) 2))))) is different from false [2024-09-11 20:39:52,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:39:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631672145] [2024-09-11 20:39:52,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:39:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161149607] [2024-09-11 20:39:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161149607] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:39:52,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:39:52,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-09-11 20:39:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056199968] [2024-09-11 20:39:52,727 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:39:52,728 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:39:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:39:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:39:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2024-09-11 20:39:52,729 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:40:01,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-11 20:40:08,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-11 20:40:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:40:09,189 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-11 20:40:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:40:09,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 55 [2024-09-11 20:40:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:40:09,192 INFO L225 Difference]: With dead ends: 71 [2024-09-11 20:40:09,192 INFO L226 Difference]: Without dead ends: 61 [2024-09-11 20:40:09,192 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2024-09-11 20:40:09,193 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:40:09,193 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-09-11 20:40:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-11 20:40:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-11 20:40:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-11 20:40:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-09-11 20:40:09,215 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 55 [2024-09-11 20:40:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:40:09,215 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-09-11 20:40:09,215 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:40:09,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:40:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-09-11 20:40:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 20:40:09,216 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:40:09,217 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 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, 1, 1] [2024-09-11 20:40:09,224 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:40:09,417 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:40:09,417 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:40:09,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:40:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash -738199481, now seen corresponding path program 1 times [2024-09-11 20:40:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:40:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317910474] [2024-09-11 20:40:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:40:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:40:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:40:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46426312] [2024-09-11 20:40:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:40:09,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:40:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:40:09,504 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-09-11 20:40:09,505 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:40:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:40:09,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 158 conjuncts are in the unsatisfiable core [2024-09-11 20:40:09,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:40:09,974 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-09-11 20:40:10,005 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-09-11 20:40:10,044 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 11 [2024-09-11 20:40:10,108 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 11 [2024-09-11 20:40:10,301 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 11 treesize of output 7 [2024-09-11 20:40:10,334 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 11 treesize of output 7 [2024-09-11 20:40:13,500 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 8 treesize of output 1 [2024-09-11 20:40:13,789 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 8 treesize of output 1 [2024-09-11 20:40:19,852 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 60 treesize of output 48 [2024-09-11 20:40:19,903 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 49 treesize of output 41 [2024-09-11 20:40:19,948 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 63 treesize of output 43 [2024-09-11 20:40:20,022 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 37 treesize of output 29 [2024-09-11 20:40:20,066 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 40 treesize of output 28 [2024-09-11 20:40:20,109 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 29 treesize of output 21 [2024-09-11 20:40:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-11 20:40:21,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:40:43,694 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8| Int)) (let ((.cse0 (* (mod (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8|)) 2147483648) 2))) (or (= (mod (+ (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8|)) (* (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8|))) 4294967296) .cse0) (not (= (mod (+ (* (select (select |c_old(#memory_int#5)| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8|) (select (select |c_old(#memory_int#6)| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8|)) (* (select (select |c_old(#memory_int#7)| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8|) (select (select |c_old(#memory_int#4)| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8|))) 4294967296) .cse0))))) (or (= (* 2 (mod (* (select (select |c_#memory_int#2| |c_func_to_recursive_line_35_to_46_0_#in~b.base|) |c_func_to_recursive_line_35_to_46_0_#in~b.offset|) (select (select |c_#memory_int#3| |c_func_to_recursive_line_35_to_46_0_#in~a.base|) |c_func_to_recursive_line_35_to_46_0_#in~a.offset|)) 2147483648)) (mod (+ (* (select (select |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~v.base|) |c_func_to_recursive_line_35_to_46_0_#in~v.offset|) (select (select |c_old(#memory_int#7)| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|)) (* (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|) (select (select |c_old(#memory_int#6)| |c_func_to_recursive_line_35_to_46_0_#in~x.base|) |c_func_to_recursive_line_35_to_46_0_#in~x.offset|))) 4294967296)) (forall ((|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8| Int)) (= (mod (+ (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8|)) (* (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8|))) 4294967296) (* (mod (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8|)) 2147483648) 2))))) is different from false [2024-09-11 20:40:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:40:47,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317910474] [2024-09-11 20:40:47,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:40:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46426312] [2024-09-11 20:40:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46426312] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:40:47,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:40:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-09-11 20:40:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472449314] [2024-09-11 20:40:47,749 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:40:47,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:40:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:40:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:40:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-09-11 20:40:47,751 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 20:40:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:40:59,721 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-09-11 20:40:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:40:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2024-09-11 20:40:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:40:59,723 INFO L225 Difference]: With dead ends: 69 [2024-09-11 20:40:59,723 INFO L226 Difference]: Without dead ends: 63 [2024-09-11 20:40:59,724 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=136, Invalid=679, Unknown=1, NotChecked=54, Total=870 [2024-09-11 20:40:59,725 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:40:59,725 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 115 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-09-11 20:40:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-11 20:40:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-11 20:40:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (20), 11 states have call predecessors, (20), 12 states have call successors, (20) [2024-09-11 20:40:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-09-11 20:40:59,754 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 55 [2024-09-11 20:40:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:40:59,756 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-09-11 20:40:59,756 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 20:40:59,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:40:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-09-11 20:40:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-11 20:40:59,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:40:59,760 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-09-11 20:40:59,769 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:40:59,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:40:59,961 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:40:59,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:40:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -787512848, now seen corresponding path program 1 times [2024-09-11 20:40:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:40:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897562830] [2024-09-11 20:40:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:40:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:41:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:41:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305799323] [2024-09-11 20:41:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:41:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:41:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:41:00,074 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-09-11 20:41:00,075 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 20:41:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:41:01,364 WARN L260 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 244 conjuncts are in the unsatisfiable core [2024-09-11 20:41:01,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:41:01,408 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-09-11 20:41:01,443 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-09-11 20:41:01,482 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 11 [2024-09-11 20:41:01,549 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 11 [2024-09-11 20:41:01,618 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 11 [2024-09-11 20:41:01,686 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 11 [2024-09-11 20:41:01,996 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 11 treesize of output 7 [2024-09-11 20:41:02,037 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 11 treesize of output 7 [2024-09-11 20:41:02,105 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 11 treesize of output 7 [2024-09-11 20:41:02,140 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 11 treesize of output 7 [2024-09-11 20:41:17,934 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 58 treesize of output 40 [2024-09-11 20:41:17,974 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 35 treesize of output 21 [2024-09-11 20:41:18,380 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 33 treesize of output 21 [2024-09-11 20:41:18,421 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 50 treesize of output 34 [2024-09-11 20:41:19,825 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 44 treesize of output 32 [2024-09-11 20:41:19,865 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 66 treesize of output 50 [2024-09-11 20:41:19,919 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 75 treesize of output 59 [2024-09-11 20:41:19,963 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 74 treesize of output 54 [2024-09-11 20:41:20,000 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 17 [2024-09-11 20:41:20,039 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 54 treesize of output 34 [2024-09-11 20:41:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-11 20:41:23,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:41:51,468 WARN L293 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-11 20:41:57,886 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-11 20:42:10,166 WARN L293 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-11 20:42:15,875 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)