./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pipeline.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/pipeline.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79bbe68806c3ba3852cd8c209d4ce80dca551636a131cc65daaf97524d927c63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:51:50,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:51:50,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:51:50,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:51:50,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:51:50,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:51:50,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:51:50,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:51:50,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:51:50,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:51:50,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:51:50,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:51:50,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:51:50,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:51:50,346 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:51:50,346 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:51:50,346 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:51:50,346 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:51:50,347 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:51:50,347 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:51:50,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:51:50,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:51:50,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:51:50,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:51:50,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:51:50,348 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:51:50,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:51:50,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:51:50,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:51:50,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:51:50,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:51:50,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:51:50,350 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:51:50,350 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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(F end) ) 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 -> 79bbe68806c3ba3852cd8c209d4ce80dca551636a131cc65daaf97524d927c63 [2025-02-08 14:51:50,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:51:50,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:51:50,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:51:50,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:51:50,643 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:51:50,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pipeline.cil-1.c [2025-02-08 14:51:51,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae4d8d790/539faaa6129a4919844b4e8531aa2ef6/FLAG41a25fdec [2025-02-08 14:51:52,290 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:51:52,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-1.c [2025-02-08 14:51:52,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae4d8d790/539faaa6129a4919844b4e8531aa2ef6/FLAG41a25fdec [2025-02-08 14:51:52,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae4d8d790/539faaa6129a4919844b4e8531aa2ef6 [2025-02-08 14:51:52,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:51:52,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:51:52,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:52,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:51:52,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:51:52,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c037122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52, skipping insertion in model container [2025-02-08 14:51:52,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:51:52,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:52,594 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:51:52,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:52,658 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:51:52,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52 WrapperNode [2025-02-08 14:51:52,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:52,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:52,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:51:52,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:51:52,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,736 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 13, calls inlined = 25, statements flattened = 1031 [2025-02-08 14:51:52,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:52,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:51:52,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:51:52,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:51:52,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,786 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 14:51:52,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:51:52,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:51:52,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:51:52,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:51:52,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (1/1) ... [2025-02-08 14:51:52,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:51:52,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:52,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:51:52,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:51:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:51:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:51:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:51:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:51:52,958 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:51:52,960 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-1: assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-1: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-2: assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-2: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:53,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-1: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-1: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-1: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-1: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-2: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-2: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-2: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-2: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:53,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: assume 1 == ~S3_zero_i~0;~S3_zero_st~0 := 0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: assume ~main_dbl_val~0 != ~main_dbl_val_t~0;~main_dbl_val~0 := ~main_dbl_val_t~0;~main_dbl_ev~0 := 0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: assume ~main_sum_val~0 != ~main_sum_val_t~0;~main_sum_val~0 := ~main_sum_val_t~0;~main_sum_ev~0 := 0; [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:53,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: assume ~main_dbl_val~0 != ~main_dbl_val_t~0;~main_dbl_val~0 := ~main_dbl_val_t~0;~main_dbl_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-1: assume ~main_sum_val~0 != ~main_sum_val_t~0;~main_sum_val~0 := ~main_sum_val_t~0;~main_sum_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-1: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: assume ~main_dbl_val~0 != ~main_dbl_val_t~0;~main_dbl_val~0 := ~main_dbl_val_t~0;~main_dbl_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-2: assume ~main_sum_val~0 != ~main_sum_val_t~0;~main_sum_val~0 := ~main_sum_val_t~0;~main_sum_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-2: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: assume ~main_clk_val~0 != ~main_clk_val_t~0;~main_clk_val~0 := ~main_clk_val_t~0;~main_clk_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: assume ~main_pres_val~0 != ~main_pres_val_t~0;~main_pres_val~0 := ~main_pres_val_t~0;~main_pres_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: assume ~main_in2_val~0 != ~main_in2_val_t~0;~main_in2_val~0 := ~main_in2_val_t~0;~main_in2_ev~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665: assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665-1: assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665-2: assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236: assume { :end_inline_D_print } true; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: assume 0 != eval_~tmp___1~0#1;~S2_presdbl_st~0 := 1;assume { :begin_inline_S2_presdbl } true;havoc S2_presdbl_~a~2#1, S2_presdbl_~b~2#1, S2_presdbl_~c~0#1, S2_presdbl_~d~0#1;havoc S2_presdbl_~a~2#1;havoc S2_presdbl_~b~2#1;havoc S2_presdbl_~c~0#1;havoc S2_presdbl_~d~0#1;S2_presdbl_~a~2#1 := ~main_sum_val~0;S2_presdbl_~b~2#1 := ~main_diff_val~0;~main_pres_val_t~0 := S2_presdbl_~a~2#1;~main_pres_req_up~0 := 1;S2_presdbl_~c~0#1 := S2_presdbl_~a~2#1 + S2_presdbl_~b~2#1;S2_presdbl_~d~0#1 := S2_presdbl_~a~2#1 - S2_presdbl_~b~2#1;~main_dbl_val_t~0 := S2_presdbl_~c~0#1 + S2_presdbl_~d~0#1;~main_dbl_req_up~0 := 1; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: assume !(0 != eval_~tmp___1~0#1); [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236-1: assume { :end_inline_D_print } true; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236-2: assume { :end_inline_D_print } true; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600-1: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600-2: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:53,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; [2025-02-08 14:51:53,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:53,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:53,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-2: assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-2: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L502: assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; [2025-02-08 14:51:53,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L502: assume !true; [2025-02-08 14:51:53,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L436: assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; [2025-02-08 14:51:53,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L436: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: assume 1 == ~main_clk_val~0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: assume !(1 == ~main_clk_val~0);~main_clk_neg_edge~0 := 0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800: havoc start_simulation_~kernel_st~0#1;assume { :end_inline_start_simulation } true;main_~count~0#1 := 1 + main_~count~0#1; [2025-02-08 14:51:53,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; [2025-02-08 14:51:53,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635-1: assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635-1: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635-2: assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635-2: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume 1 == ~D_print_i~0;~D_print_st~0 := 0; [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; [2025-02-08 14:51:53,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc S2_presdbl_~a~2#1, S2_presdbl_~b~2#1, S2_presdbl_~c~0#1, S2_presdbl_~d~0#1;assume { :end_inline_S2_presdbl } true; [2025-02-08 14:51:53,963 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: assume 0 != eval_~tmp~0#1;~N_generate_st~0 := 1;assume { :begin_inline_N_generate } true;havoc N_generate_~a~0#1, N_generate_~b~0#1;havoc N_generate_~a~0#1;havoc N_generate_~b~0#1;~main_in1_val_t~0 := N_generate_~a~0#1;~main_in1_req_up~0 := 1;~main_in2_val_t~0 := N_generate_~b~0#1;~main_in2_req_up~0 := 1; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: assume !(0 != eval_~tmp~0#1); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L206-1: havoc S2_presdbl_~a~2#1, S2_presdbl_~b~2#1, S2_presdbl_~c~0#1, S2_presdbl_~d~0#1;assume { :end_inline_S2_presdbl } true; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L206-2: havoc S2_presdbl_~a~2#1, S2_presdbl_~b~2#1, S2_presdbl_~c~0#1, S2_presdbl_~d~0#1;assume { :end_inline_S2_presdbl } true; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670-1: assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670-2: assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-1: start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:53,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-1: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-2: start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538-1: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-2: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538-2: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L274: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume 5 == main_~count~0#1; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume !(5 == main_~count~0#1); [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605-1: assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605-1: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605-2: assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605-2: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-2: havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176: havoc N_generate_~a~0#1, N_generate_~b~0#1;assume { :end_inline_N_generate } true; [2025-02-08 14:51:53,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-1: havoc N_generate_~a~0#1, N_generate_~b~0#1;assume { :end_inline_N_generate } true; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-2: havoc N_generate_~a~0#1, N_generate_~b~0#1;assume { :end_inline_N_generate } true; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L804: assume 0 == ~D_z~0;assume { :begin_inline_error } true;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L804: assume !(0 == ~D_z~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-1: assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-1: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-2: assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-2: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; [2025-02-08 14:51:53,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640-1: assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640-1: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640-2: assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640-2: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:53,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: assume { :end_inline_error } true; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-1: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-1: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-1: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-1: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-2: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-2: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L476: assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L476: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-1: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-1: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-2: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-2: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-2: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-2: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:53,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: assume true; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: assume !true; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-1: assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-2: assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: assume ~main_zero_val~0 != ~main_zero_val_t~0;~main_zero_val~0 := ~main_zero_val_t~0;~main_zero_ev~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: assume ~main_diff_val~0 != ~main_diff_val_t~0;~main_diff_val~0 := ~main_diff_val_t~0;~main_diff_ev~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-1: assume ~main_zero_val~0 != ~main_zero_val_t~0;~main_zero_val~0 := ~main_zero_val_t~0;~main_zero_ev~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-1: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: assume ~main_in1_val~0 != ~main_in1_val_t~0;~main_in1_val~0 := ~main_in1_val_t~0;~main_in1_ev~0 := 0; [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:53,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-1: assume ~main_diff_val~0 != ~main_diff_val_t~0;~main_diff_val~0 := ~main_diff_val_t~0;~main_diff_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-1: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-2: assume ~main_zero_val~0 != ~main_zero_val_t~0;~main_zero_val~0 := ~main_zero_val_t~0;~main_zero_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-2: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510-1: assume ~main_in1_val~0 != ~main_in1_val_t~0;~main_in1_val~0 := ~main_in1_val_t~0;~main_in1_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510-1: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-2: assume ~main_diff_val~0 != ~main_diff_val_t~0;~main_diff_val~0 := ~main_diff_val_t~0;~main_diff_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-2: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510-2: assume ~main_in1_val~0 != ~main_in1_val_t~0;~main_in1_val~0 := ~main_in1_val_t~0;~main_in1_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510-2: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume ~main_dbl_val~0 != ~main_dbl_val_t~0;~main_dbl_val~0 := ~main_dbl_val_t~0;~main_dbl_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: assume ~main_sum_val~0 != ~main_sum_val_t~0;~main_sum_val~0 := ~main_sum_val_t~0;~main_sum_ev~0 := 0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume 0 == ~D_print_st~0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume 0 == ~D_print_st~0; [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:53,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume 0 == ~D_print_st~0; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-1: assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-1: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-2: assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-2: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: assume 0 == ~S3_zero_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; [2025-02-08 14:51:53,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:53,973 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; [2025-02-08 14:51:53,973 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,973 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L347: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-2: assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-2: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L811: main_~count~0#1 := 0; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: assume 0 == ~S1_addsub_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680-1: assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680-1: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680-2: assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680-2: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume 0 != eval_~tmp___2~0#1;~S3_zero_st~0 := 1;assume { :begin_inline_S3_zero } true;havoc S3_zero_~a~3#1, S3_zero_~b~3#1;havoc S3_zero_~a~3#1;havoc S3_zero_~b~3#1;S3_zero_~a~3#1 := ~main_pres_val~0;S3_zero_~b~3#1 := ~main_dbl_val~0;~main_zero_val_t~0 := S3_zero_~b~3#1 - (S3_zero_~a~3#1 + S3_zero_~a~3#1);~main_zero_req_up~0 := 1; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume !(0 != eval_~tmp___2~0#1); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:53,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L549: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582-1: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-1: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582-2: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-1: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-2: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-2: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: assume 1 == ~N_generate_i~0;~N_generate_st~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-2: assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-2: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L451: assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; [2025-02-08 14:51:53,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L451: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650: assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650-1: assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650-1: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650-2: assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650-2: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: havoc S3_zero_~a~3#1, S3_zero_~b~3#1;assume { :end_inline_S3_zero } true; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: assume 0 != eval_~tmp___0~0#1;~S1_addsub_st~0 := 1;assume { :begin_inline_S1_addsub } true;havoc S1_addsub_~a~1#1, S1_addsub_~b~1#1;havoc S1_addsub_~a~1#1;havoc S1_addsub_~b~1#1;S1_addsub_~a~1#1 := ~main_in1_val~0;S1_addsub_~b~1#1 := ~main_in2_val~0;~main_sum_val_t~0 := S1_addsub_~a~1#1 + S1_addsub_~b~1#1;~main_sum_req_up~0 := 1;~main_diff_val_t~0 := S1_addsub_~a~1#1 - S1_addsub_~b~1#1;~main_diff_req_up~0 := 1; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: assume !(0 != eval_~tmp___0~0#1); [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221-1: havoc S3_zero_~a~3#1, S3_zero_~b~3#1;assume { :end_inline_S3_zero } true; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221-2: havoc S3_zero_~a~3#1, S3_zero_~b~3#1;assume { :end_inline_S3_zero } true; [2025-02-08 14:51:53,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: ~main_clk_val_t~0 := 0;~main_clk_req_up~0 := 1;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; [2025-02-08 14:51:53,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; [2025-02-08 14:51:53,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:53,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; [2025-02-08 14:51:53,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-1: assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-1: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-2: assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-2: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-1: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-1: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:53,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-1: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-1: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-2: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-2: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-1: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-1: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-2: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-2: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-2: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:53,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-2: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:53,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L818: havoc start_simulation_~kernel_st~0#1;assume { :end_inline_start_simulation } true; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: assume ~main_clk_val~0 != ~main_clk_val_t~0;~main_clk_val~0 := ~main_clk_val_t~0;~main_clk_ev~0 := 0; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-1: assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-1: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: assume ~main_pres_val~0 != ~main_pres_val_t~0;~main_pres_val~0 := ~main_pres_val_t~0;~main_pres_ev~0 := 0; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587-1: assume ~main_clk_val~0 != ~main_clk_val_t~0;~main_clk_val~0 := ~main_clk_val_t~0;~main_clk_ev~0 := 0; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587-1: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-2: assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-2: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:53,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: assume ~main_in2_val~0 != ~main_in2_val_t~0;~main_in2_val~0 := ~main_in2_val_t~0;~main_in2_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554-1: assume ~main_pres_val~0 != ~main_pres_val_t~0;~main_pres_val~0 := ~main_pres_val_t~0;~main_pres_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554-1: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587-2: assume ~main_clk_val~0 != ~main_clk_val_t~0;~main_clk_val~0 := ~main_clk_val_t~0;~main_clk_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587-2: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521-1: assume ~main_in2_val~0 != ~main_in2_val_t~0;~main_in2_val~0 := ~main_in2_val_t~0;~main_in2_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521-1: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554-2: assume ~main_pres_val~0 != ~main_pres_val_t~0;~main_pres_val~0 := ~main_pres_val_t~0;~main_pres_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554-2: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521-2: assume ~main_in2_val~0 != ~main_in2_val_t~0;~main_in2_val~0 := ~main_in2_val_t~0;~main_in2_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521-2: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume 1 == ~S1_addsub_i~0;~S1_addsub_st~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume ~main_zero_val~0 != ~main_zero_val_t~0;~main_zero_val~0 := ~main_zero_val_t~0;~main_zero_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: assume ~main_diff_val~0 != ~main_diff_val_t~0;~main_diff_val~0 := ~main_diff_val_t~0;~main_diff_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L257: assume ~main_in1_val~0 != ~main_in1_val_t~0;~main_in1_val~0 := ~main_in1_val_t~0;~main_in1_ev~0 := 0; [2025-02-08 14:51:53,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L257: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:53,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc S1_addsub_~a~1#1, S1_addsub_~b~1#1;assume { :end_inline_S1_addsub } true; [2025-02-08 14:51:53,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L191-1: havoc S1_addsub_~a~1#1, S1_addsub_~b~1#1;assume { :end_inline_S1_addsub } true; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L191-2: havoc S1_addsub_~a~1#1, S1_addsub_~b~1#1;assume { :end_inline_S1_addsub } true; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-1: assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-2: assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: assume 0 == ~D_print_st~0; [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:53,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: assume 1 == ~main_clk_val~0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: assume !(1 == ~main_clk_val~0);~main_clk_neg_edge~0 := 0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L590-1: assume 1 == ~main_clk_val~0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L590-1: assume !(1 == ~main_clk_val~0);~main_clk_neg_edge~0 := 0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L590-2: assume 1 == ~main_clk_val~0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L590-2: assume !(1 == ~main_clk_val~0);~main_clk_neg_edge~0 := 0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L491: assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L491: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-1: assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-1: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-2: assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-2: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L426: assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L426: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-2: assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-2: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: assume 0 == ~D_print_st~0;havoc eval_#t~nondet8#1;eval_~tmp___3~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; [2025-02-08 14:51:53,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-2: assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-2: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-2: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-2: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L296: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660: assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660-1: assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660-2: assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: assume 0 == ~S2_presdbl_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-1: assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-1: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:53,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-2: assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; [2025-02-08 14:51:53,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-2: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:53,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; [2025-02-08 14:51:53,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:53,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L233: assume 0 != eval_~tmp___3~0#1;~D_print_st~0 := 1;assume { :begin_inline_D_print } true;~D_z~0 := ~main_zero_val~0; [2025-02-08 14:51:53,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L233: assume !(0 != eval_~tmp___3~0#1); [2025-02-08 14:51:54,028 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-08 14:51:54,029 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:51:54,045 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:51:54,045 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:51:54,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:54 BoogieIcfgContainer [2025-02-08 14:51:54,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:51:54,046 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:51:54,047 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:51:54,052 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:51:54,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:54,053 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:51:52" (1/3) ... [2025-02-08 14:51:54,054 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60a562c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:54, skipping insertion in model container [2025-02-08 14:51:54,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:54,054 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:52" (2/3) ... [2025-02-08 14:51:54,056 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60a562c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:54, skipping insertion in model container [2025-02-08 14:51:54,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:54,056 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:54" (3/3) ... [2025-02-08 14:51:54,058 INFO L363 chiAutomizerObserver]: Analyzing ICFG pipeline.cil-1.c [2025-02-08 14:51:54,105 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:51:54,106 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:51:54,106 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:51:54,106 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:51:54,106 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:51:54,106 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:51:54,106 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:51:54,106 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:51:54,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 163 states, 147 states have (on average 1.8775510204081634) internal successors, (276), 162 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:54,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-08 14:51:54,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:54,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:54,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,146 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:51:54,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 163 states, 147 states have (on average 1.8775510204081634) internal successors, (276), 162 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:54,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-08 14:51:54,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:54,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:54,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,167 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1;" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1;" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:54,168 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~N_generate_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2039981232, now seen corresponding path program 1 times [2025-02-08 14:51:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085630765] [2025-02-08 14:51:54,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:54,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:54,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:54,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085630765] [2025-02-08 14:51:54,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085630765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:54,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:54,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354374867] [2025-02-08 14:51:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:54,436 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:54,438 INFO L85 PathProgramCache]: Analyzing trace with hash 107793701, now seen corresponding path program 1 times [2025-02-08 14:51:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:54,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55768426] [2025-02-08 14:51:54,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:54,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:51:54,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:51:54,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55768426] [2025-02-08 14:51:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55768426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:54,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:54,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:54,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500194213] [2025-02-08 14:51:54,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:54,469 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:54,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:54,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:54,494 INFO L87 Difference]: Start difference. First operand has 163 states, 147 states have (on average 1.8775510204081634) internal successors, (276), 162 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:54,543 INFO L93 Difference]: Finished difference Result 124 states and 213 transitions. [2025-02-08 14:51:54,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 213 transitions. [2025-02-08 14:51:54,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:54,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 114 states and 203 transitions. [2025-02-08 14:51:54,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2025-02-08 14:51:54,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-02-08 14:51:54,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 203 transitions. [2025-02-08 14:51:54,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:54,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 203 transitions. [2025-02-08 14:51:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 203 transitions. [2025-02-08 14:51:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-08 14:51:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.780701754385965) internal successors, (203), 113 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 203 transitions. [2025-02-08 14:51:54,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 203 transitions. [2025-02-08 14:51:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:54,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 114 states and 203 transitions. [2025-02-08 14:51:54,600 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:51:54,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 203 transitions. [2025-02-08 14:51:54,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:54,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:54,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:54,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,603 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume 1 == ~N_generate_i~0;~N_generate_st~0 := 0;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1;" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1;" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:54,603 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~N_generate_st~0;" "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1689181295, now seen corresponding path program 1 times [2025-02-08 14:51:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223059663] [2025-02-08 14:51:54,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:54,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:54,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:54,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223059663] [2025-02-08 14:51:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223059663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604604045] [2025-02-08 14:51:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:54,675 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:54,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 1 times [2025-02-08 14:51:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:54,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226004742] [2025-02-08 14:51:54,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:54,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:54,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:54,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:54,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:54,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:54,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:54,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:54,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:54,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:54,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:54,759 INFO L87 Difference]: Start difference. First operand 114 states and 203 transitions. cyclomatic complexity: 91 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:54,774 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2025-02-08 14:51:54,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 172 transitions. [2025-02-08 14:51:54,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:54,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 172 transitions. [2025-02-08 14:51:54,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-02-08 14:51:54,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2025-02-08 14:51:54,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 172 transitions. [2025-02-08 14:51:54,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:54,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 172 transitions. [2025-02-08 14:51:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 172 transitions. [2025-02-08 14:51:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 14:51:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 98 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 172 transitions. [2025-02-08 14:51:54,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 172 transitions. [2025-02-08 14:51:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:54,782 INFO L432 stractBuchiCegarLoop]: Abstraction has 99 states and 172 transitions. [2025-02-08 14:51:54,783 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:51:54,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 172 transitions. [2025-02-08 14:51:54,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:54,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:54,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:54,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:54,785 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1;" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1;" "assume !(0 == ~main_clk_neg_edge~0);" "assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0;" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:54,785 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~N_generate_st~0;" "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1744451887, now seen corresponding path program 1 times [2025-02-08 14:51:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287050666] [2025-02-08 14:51:54,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:54,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:54,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287050666] [2025-02-08 14:51:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287050666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:54,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319372931] [2025-02-08 14:51:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:54,923 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:54,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 2 times [2025-02-08 14:51:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:54,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734321340] [2025-02-08 14:51:54,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:54,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:54,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:54,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:54,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:54,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:54,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:54,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:54,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:54,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:54,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:54,975 INFO L87 Difference]: Start difference. First operand 99 states and 172 transitions. cyclomatic complexity: 75 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,003 INFO L93 Difference]: Finished difference Result 195 states and 336 transitions. [2025-02-08 14:51:55,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 336 transitions. [2025-02-08 14:51:55,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-08 14:51:55,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 336 transitions. [2025-02-08 14:51:55,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2025-02-08 14:51:55,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2025-02-08 14:51:55,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 336 transitions. [2025-02-08 14:51:55,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 336 transitions. [2025-02-08 14:51:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 336 transitions. [2025-02-08 14:51:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 148. [2025-02-08 14:51:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.7432432432432432) internal successors, (258), 147 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2025-02-08 14:51:55,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 258 transitions. [2025-02-08 14:51:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:55,036 INFO L432 stractBuchiCegarLoop]: Abstraction has 148 states and 258 transitions. [2025-02-08 14:51:55,036 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:51:55,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 258 transitions. [2025-02-08 14:51:55,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:55,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,039 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1;" "assume !(0 == ~main_clk_neg_edge~0);" "assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0;" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:55,039 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~N_generate_st~0;" "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:55,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1713432080, now seen corresponding path program 1 times [2025-02-08 14:51:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782316561] [2025-02-08 14:51:55,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:55,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:55,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782316561] [2025-02-08 14:51:55,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782316561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28477638] [2025-02-08 14:51:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,136 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 3 times [2025-02-08 14:51:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377268502] [2025-02-08 14:51:55,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:55,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:55,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:55,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:55,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:55,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:55,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:55,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:55,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:55,186 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. cyclomatic complexity: 112 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,265 INFO L93 Difference]: Finished difference Result 252 states and 437 transitions. [2025-02-08 14:51:55,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 437 transitions. [2025-02-08 14:51:55,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-08 14:51:55,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 252 states and 437 transitions. [2025-02-08 14:51:55,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2025-02-08 14:51:55,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2025-02-08 14:51:55,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 437 transitions. [2025-02-08 14:51:55,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 252 states and 437 transitions. [2025-02-08 14:51:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 437 transitions. [2025-02-08 14:51:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 178. [2025-02-08 14:51:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 1.747191011235955) internal successors, (311), 177 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 311 transitions. [2025-02-08 14:51:55,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 311 transitions. [2025-02-08 14:51:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:55,295 INFO L432 stractBuchiCegarLoop]: Abstraction has 178 states and 311 transitions. [2025-02-08 14:51:55,295 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:51:55,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 311 transitions. [2025-02-08 14:51:55,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:55,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,297 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0;" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:55,297 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~N_generate_st~0;" "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1584462863, now seen corresponding path program 1 times [2025-02-08 14:51:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301870330] [2025-02-08 14:51:55,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301870330] [2025-02-08 14:51:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301870330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377197127] [2025-02-08 14:51:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,380 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:55,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 4 times [2025-02-08 14:51:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655456654] [2025-02-08 14:51:55,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:51:55,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:55,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:55,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:55,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:55,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:55,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:55,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:55,421 INFO L87 Difference]: Start difference. First operand 178 states and 311 transitions. cyclomatic complexity: 135 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,459 INFO L93 Difference]: Finished difference Result 231 states and 389 transitions. [2025-02-08 14:51:55,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 389 transitions. [2025-02-08 14:51:55,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-08 14:51:55,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 231 states and 389 transitions. [2025-02-08 14:51:55,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2025-02-08 14:51:55,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2025-02-08 14:51:55,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 389 transitions. [2025-02-08 14:51:55,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 389 transitions. [2025-02-08 14:51:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 389 transitions. [2025-02-08 14:51:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 200. [2025-02-08 14:51:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 1.715) internal successors, (343), 199 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 343 transitions. [2025-02-08 14:51:55,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 200 states and 343 transitions. [2025-02-08 14:51:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:55,479 INFO L432 stractBuchiCegarLoop]: Abstraction has 200 states and 343 transitions. [2025-02-08 14:51:55,479 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:51:55,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 343 transitions. [2025-02-08 14:51:55,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:55,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,481 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:55,482 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume 0 == ~S1_addsub_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:55,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 1 times [2025-02-08 14:51:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298626948] [2025-02-08 14:51:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:55,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:55,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298626948] [2025-02-08 14:51:55,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298626948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:55,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329284127] [2025-02-08 14:51:55,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,576 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash 168900780, now seen corresponding path program 1 times [2025-02-08 14:51:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067101124] [2025-02-08 14:51:55,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:55,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067101124] [2025-02-08 14:51:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067101124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139554484] [2025-02-08 14:51:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,592 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:55,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:55,593 INFO L87 Difference]: Start difference. First operand 200 states and 343 transitions. cyclomatic complexity: 145 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,611 INFO L93 Difference]: Finished difference Result 336 states and 581 transitions. [2025-02-08 14:51:55,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 336 states and 581 transitions. [2025-02-08 14:51:55,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:55,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 336 states to 336 states and 581 transitions. [2025-02-08 14:51:55,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-02-08 14:51:55,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-02-08 14:51:55,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 581 transitions. [2025-02-08 14:51:55,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 336 states and 581 transitions. [2025-02-08 14:51:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 581 transitions. [2025-02-08 14:51:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-08 14:51:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 336 states have (on average 1.7291666666666667) internal successors, (581), 335 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 581 transitions. [2025-02-08 14:51:55,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 336 states and 581 transitions. [2025-02-08 14:51:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:55,626 INFO L432 stractBuchiCegarLoop]: Abstraction has 336 states and 581 transitions. [2025-02-08 14:51:55,626 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:51:55,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 581 transitions. [2025-02-08 14:51:55,628 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:55,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,629 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,629 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume 1 == ~S1_addsub_i~0;~S1_addsub_st~0 := 0;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:55,632 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume 0 == ~S1_addsub_st~0;" "assume !(0 == ~N_generate_st~0);" "assume 0 == ~S1_addsub_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1062612559, now seen corresponding path program 1 times [2025-02-08 14:51:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879616182] [2025-02-08 14:51:55,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:55,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879616182] [2025-02-08 14:51:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879616182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879649569] [2025-02-08 14:51:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,683 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:55,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash 940159111, now seen corresponding path program 1 times [2025-02-08 14:51:55,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813888063] [2025-02-08 14:51:55,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:55,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:55,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:55,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:55,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:55,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:55,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:55,730 INFO L87 Difference]: Start difference. First operand 336 states and 581 transitions. cyclomatic complexity: 249 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,734 INFO L93 Difference]: Finished difference Result 258 states and 437 transitions. [2025-02-08 14:51:55,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 437 transitions. [2025-02-08 14:51:55,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:55,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 437 transitions. [2025-02-08 14:51:55,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2025-02-08 14:51:55,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2025-02-08 14:51:55,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 437 transitions. [2025-02-08 14:51:55,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 437 transitions. [2025-02-08 14:51:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 437 transitions. [2025-02-08 14:51:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-08 14:51:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 258 states have (on average 1.693798449612403) internal successors, (437), 257 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 437 transitions. [2025-02-08 14:51:55,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 258 states and 437 transitions. [2025-02-08 14:51:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:55,749 INFO L432 stractBuchiCegarLoop]: Abstraction has 258 states and 437 transitions. [2025-02-08 14:51:55,749 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:51:55,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 437 transitions. [2025-02-08 14:51:55,751 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:55,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,752 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:55,752 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume 0 == ~S2_presdbl_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 2 times [2025-02-08 14:51:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356111267] [2025-02-08 14:51:55,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:55,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:55,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356111267] [2025-02-08 14:51:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356111267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:55,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937364150] [2025-02-08 14:51:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,794 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:55,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2005961927, now seen corresponding path program 1 times [2025-02-08 14:51:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526338220] [2025-02-08 14:51:55,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:55,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:55,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526338220] [2025-02-08 14:51:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526338220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622452724] [2025-02-08 14:51:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,807 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:55,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:55,807 INFO L87 Difference]: Start difference. First operand 258 states and 437 transitions. cyclomatic complexity: 183 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,833 INFO L93 Difference]: Finished difference Result 447 states and 763 transitions. [2025-02-08 14:51:55,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 447 states and 763 transitions. [2025-02-08 14:51:55,837 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:55,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 447 states to 447 states and 763 transitions. [2025-02-08 14:51:55,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 447 [2025-02-08 14:51:55,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2025-02-08 14:51:55,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 447 states and 763 transitions. [2025-02-08 14:51:55,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 447 states and 763 transitions. [2025-02-08 14:51:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states and 763 transitions. [2025-02-08 14:51:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-02-08 14:51:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 447 states have (on average 1.7069351230425056) internal successors, (763), 446 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 763 transitions. [2025-02-08 14:51:55,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 447 states and 763 transitions. [2025-02-08 14:51:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:55,856 INFO L432 stractBuchiCegarLoop]: Abstraction has 447 states and 763 transitions. [2025-02-08 14:51:55,858 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:51:55,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 763 transitions. [2025-02-08 14:51:55,861 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:55,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,862 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:55,862 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume 0 == ~S2_presdbl_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume 0 == ~S2_presdbl_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___1~0#1);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:55,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 380826989, now seen corresponding path program 1 times [2025-02-08 14:51:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386609522] [2025-02-08 14:51:55,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:55,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:55,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386609522] [2025-02-08 14:51:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386609522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239174713] [2025-02-08 14:51:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,942 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:55,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2055252464, now seen corresponding path program 1 times [2025-02-08 14:51:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981632117] [2025-02-08 14:51:55,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:55,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:51:55,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:55,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:55,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:51:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:55,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:55,991 INFO L87 Difference]: Start difference. First operand 447 states and 763 transitions. cyclomatic complexity: 324 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,013 INFO L93 Difference]: Finished difference Result 361 states and 603 transitions. [2025-02-08 14:51:56,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 603 transitions. [2025-02-08 14:51:56,017 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:56,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 361 states and 603 transitions. [2025-02-08 14:51:56,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 361 [2025-02-08 14:51:56,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2025-02-08 14:51:56,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 603 transitions. [2025-02-08 14:51:56,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,024 INFO L218 hiAutomatonCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-08 14:51:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 603 transitions. [2025-02-08 14:51:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-08 14:51:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 361 states have (on average 1.6703601108033241) internal successors, (603), 360 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2025-02-08 14:51:56,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-08 14:51:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-08 14:51:56,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:51:56,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 603 transitions. [2025-02-08 14:51:56,039 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:56,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,041 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:56,041 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume 0 == ~S3_zero_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:56,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 3 times [2025-02-08 14:51:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33136251] [2025-02-08 14:51:56,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:56,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:56,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33136251] [2025-02-08 14:51:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33136251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721991543] [2025-02-08 14:51:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,129 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1231942962, now seen corresponding path program 1 times [2025-02-08 14:51:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392461084] [2025-02-08 14:51:56,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:51:56,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392461084] [2025-02-08 14:51:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392461084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117453802] [2025-02-08 14:51:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,142 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:56,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,143 INFO L87 Difference]: Start difference. First operand 361 states and 603 transitions. cyclomatic complexity: 250 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,161 INFO L93 Difference]: Finished difference Result 650 states and 1093 transitions. [2025-02-08 14:51:56,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 1093 transitions. [2025-02-08 14:51:56,165 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:56,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 650 states and 1093 transitions. [2025-02-08 14:51:56,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 650 [2025-02-08 14:51:56,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2025-02-08 14:51:56,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 1093 transitions. [2025-02-08 14:51:56,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 1093 transitions. [2025-02-08 14:51:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 1093 transitions. [2025-02-08 14:51:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2025-02-08 14:51:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 650 states have (on average 1.6815384615384616) internal successors, (1093), 649 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1093 transitions. [2025-02-08 14:51:56,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 650 states and 1093 transitions. [2025-02-08 14:51:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,183 INFO L432 stractBuchiCegarLoop]: Abstraction has 650 states and 1093 transitions. [2025-02-08 14:51:56,183 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:51:56,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 650 states and 1093 transitions. [2025-02-08 14:51:56,187 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:56,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,188 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume 1 == ~S3_zero_i~0;~S3_zero_st~0 := 0;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:56,188 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume 0 == ~S3_zero_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume 0 == ~S3_zero_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1;" "assume !(0 != eval_~tmp___2~0#1);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1328665231, now seen corresponding path program 1 times [2025-02-08 14:51:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099323494] [2025-02-08 14:51:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:56,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099323494] [2025-02-08 14:51:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099323494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88506941] [2025-02-08 14:51:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,228 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 464473637, now seen corresponding path program 1 times [2025-02-08 14:51:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247977987] [2025-02-08 14:51:56,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:56,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:56,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:56,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,270 INFO L87 Difference]: Start difference. First operand 650 states and 1093 transitions. cyclomatic complexity: 459 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,278 INFO L93 Difference]: Finished difference Result 556 states and 917 transitions. [2025-02-08 14:51:56,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 917 transitions. [2025-02-08 14:51:56,281 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:56,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 556 states and 917 transitions. [2025-02-08 14:51:56,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 556 [2025-02-08 14:51:56,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 556 [2025-02-08 14:51:56,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 917 transitions. [2025-02-08 14:51:56,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 556 states and 917 transitions. [2025-02-08 14:51:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 917 transitions. [2025-02-08 14:51:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-02-08 14:51:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 556 states have (on average 1.6492805755395683) internal successors, (917), 555 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 917 transitions. [2025-02-08 14:51:56,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 556 states and 917 transitions. [2025-02-08 14:51:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,296 INFO L432 stractBuchiCegarLoop]: Abstraction has 556 states and 917 transitions. [2025-02-08 14:51:56,296 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:51:56,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 556 states and 917 transitions. [2025-02-08 14:51:56,300 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:56,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,300 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:56,300 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume 0 == ~D_print_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" [2025-02-08 14:51:56,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 4 times [2025-02-08 14:51:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662779052] [2025-02-08 14:51:56,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-08 14:51:56,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:56,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:56,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662779052] [2025-02-08 14:51:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662779052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342501354] [2025-02-08 14:51:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,339 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1414962281, now seen corresponding path program 1 times [2025-02-08 14:51:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319781402] [2025-02-08 14:51:56,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319781402] [2025-02-08 14:51:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319781402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596537727] [2025-02-08 14:51:56,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,355 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,356 INFO L87 Difference]: Start difference. First operand 556 states and 917 transitions. cyclomatic complexity: 377 Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,373 INFO L93 Difference]: Finished difference Result 1024 states and 1693 transitions. [2025-02-08 14:51:56,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1024 states and 1693 transitions. [2025-02-08 14:51:56,380 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:56,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1024 states to 1024 states and 1693 transitions. [2025-02-08 14:51:56,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1024 [2025-02-08 14:51:56,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1024 [2025-02-08 14:51:56,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1024 states and 1693 transitions. [2025-02-08 14:51:56,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1024 states and 1693 transitions. [2025-02-08 14:51:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states and 1693 transitions. [2025-02-08 14:51:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1023. [2025-02-08 14:51:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1023 states have (on average 1.653958944281525) internal successors, (1692), 1022 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1692 transitions. [2025-02-08 14:51:56,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1023 states and 1692 transitions. [2025-02-08 14:51:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,408 INFO L432 stractBuchiCegarLoop]: Abstraction has 1023 states and 1692 transitions. [2025-02-08 14:51:56,408 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:51:56,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1023 states and 1692 transitions. [2025-02-08 14:51:56,415 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:56,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,416 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume 1 == ~D_print_i~0;~D_print_st~0 := 0;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:56,417 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume 0 == ~D_print_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume 0 == ~D_print_st~0;havoc eval_#t~nondet8#1;eval_~tmp___3~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1;" "assume !(0 != eval_~tmp___3~0#1);" [2025-02-08 14:51:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 112314669, now seen corresponding path program 1 times [2025-02-08 14:51:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12664422] [2025-02-08 14:51:56,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:56,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12664422] [2025-02-08 14:51:56,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12664422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591125113] [2025-02-08 14:51:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,450 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash 914158350, now seen corresponding path program 1 times [2025-02-08 14:51:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636334523] [2025-02-08 14:51:56,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:56,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:56,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:56,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:56,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,494 INFO L87 Difference]: Start difference. First operand 1023 states and 1692 transitions. cyclomatic complexity: 700 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,514 INFO L93 Difference]: Finished difference Result 901 states and 1460 transitions. [2025-02-08 14:51:56,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 901 states and 1460 transitions. [2025-02-08 14:51:56,520 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:56,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 901 states to 901 states and 1460 transitions. [2025-02-08 14:51:56,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 901 [2025-02-08 14:51:56,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 901 [2025-02-08 14:51:56,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 901 states and 1460 transitions. [2025-02-08 14:51:56,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 901 states and 1460 transitions. [2025-02-08 14:51:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states and 1460 transitions. [2025-02-08 14:51:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2025-02-08 14:51:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 901 states have (on average 1.6204217536071033) internal successors, (1460), 900 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1460 transitions. [2025-02-08 14:51:56,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 901 states and 1460 transitions. [2025-02-08 14:51:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,544 INFO L432 stractBuchiCegarLoop]: Abstraction has 901 states and 1460 transitions. [2025-02-08 14:51:56,544 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:51:56,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 901 states and 1460 transitions. [2025-02-08 14:51:56,549 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:56,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,550 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:56,550 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:56,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1253337580, now seen corresponding path program 1 times [2025-02-08 14:51:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634909476] [2025-02-08 14:51:56,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:56,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:56,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634909476] [2025-02-08 14:51:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634909476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373077416] [2025-02-08 14:51:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,602 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 5 times [2025-02-08 14:51:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239309721] [2025-02-08 14:51:56,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:51:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,608 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:56,608 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:56,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:56,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:56,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:56,643 INFO L87 Difference]: Start difference. First operand 901 states and 1460 transitions. cyclomatic complexity: 590 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,705 INFO L93 Difference]: Finished difference Result 1520 states and 2356 transitions. [2025-02-08 14:51:56,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1520 states and 2356 transitions. [2025-02-08 14:51:56,714 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:56,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1520 states to 1520 states and 2356 transitions. [2025-02-08 14:51:56,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1520 [2025-02-08 14:51:56,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1520 [2025-02-08 14:51:56,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1520 states and 2356 transitions. [2025-02-08 14:51:56,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1520 states and 2356 transitions. [2025-02-08 14:51:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states and 2356 transitions. [2025-02-08 14:51:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1104. [2025-02-08 14:51:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1104 states have (on average 1.6195652173913044) internal successors, (1788), 1103 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1788 transitions. [2025-02-08 14:51:56,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1104 states and 1788 transitions. [2025-02-08 14:51:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:56,747 INFO L432 stractBuchiCegarLoop]: Abstraction has 1104 states and 1788 transitions. [2025-02-08 14:51:56,747 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-08 14:51:56,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1104 states and 1788 transitions. [2025-02-08 14:51:56,752 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:56,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,753 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1;" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2;" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:56,753 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:56,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 291723563, now seen corresponding path program 1 times [2025-02-08 14:51:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812649868] [2025-02-08 14:51:56,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:56,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:56,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812649868] [2025-02-08 14:51:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812649868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614500457] [2025-02-08 14:51:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,800 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 6 times [2025-02-08 14:51:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457510379] [2025-02-08 14:51:56,801 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:51:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,804 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:56,804 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:51:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:56,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:56,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:56,839 INFO L87 Difference]: Start difference. First operand 1104 states and 1788 transitions. cyclomatic complexity: 715 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,876 INFO L93 Difference]: Finished difference Result 1911 states and 3032 transitions. [2025-02-08 14:51:56,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1911 states and 3032 transitions. [2025-02-08 14:51:56,904 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:56,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1911 states to 1911 states and 3032 transitions. [2025-02-08 14:51:56,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1911 [2025-02-08 14:51:56,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1911 [2025-02-08 14:51:56,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1911 states and 3032 transitions. [2025-02-08 14:51:56,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1911 states and 3032 transitions. [2025-02-08 14:51:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states and 3032 transitions. [2025-02-08 14:51:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1170. [2025-02-08 14:51:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1170 states have (on average 1.6051282051282052) internal successors, (1878), 1169 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1878 transitions. [2025-02-08 14:51:56,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1878 transitions. [2025-02-08 14:51:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:56,941 INFO L432 stractBuchiCegarLoop]: Abstraction has 1170 states and 1878 transitions. [2025-02-08 14:51:56,941 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-08 14:51:56,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1170 states and 1878 transitions. [2025-02-08 14:51:56,947 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:56,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,948 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:56,948 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1382420299, now seen corresponding path program 1 times [2025-02-08 14:51:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315540932] [2025-02-08 14:51:56,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:56,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:56,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315540932] [2025-02-08 14:51:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315540932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612647662] [2025-02-08 14:51:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,008 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 7 times [2025-02-08 14:51:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393993077] [2025-02-08 14:51:57,008 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:51:57,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:57,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:57,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:57,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:57,055 INFO L87 Difference]: Start difference. First operand 1170 states and 1878 transitions. cyclomatic complexity: 739 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,130 INFO L93 Difference]: Finished difference Result 2202 states and 3509 transitions. [2025-02-08 14:51:57,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2202 states and 3509 transitions. [2025-02-08 14:51:57,146 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:57,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2202 states to 2202 states and 3509 transitions. [2025-02-08 14:51:57,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2202 [2025-02-08 14:51:57,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2202 [2025-02-08 14:51:57,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2202 states and 3509 transitions. [2025-02-08 14:51:57,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2202 states and 3509 transitions. [2025-02-08 14:51:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states and 3509 transitions. [2025-02-08 14:51:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1775. [2025-02-08 14:51:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1775 states have (on average 1.6540845070422536) internal successors, (2936), 1774 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2936 transitions. [2025-02-08 14:51:57,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1775 states and 2936 transitions. [2025-02-08 14:51:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:57,202 INFO L432 stractBuchiCegarLoop]: Abstraction has 1775 states and 2936 transitions. [2025-02-08 14:51:57,202 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-08 14:51:57,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1775 states and 2936 transitions. [2025-02-08 14:51:57,207 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,208 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1;" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:57,208 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:57,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2068075126, now seen corresponding path program 1 times [2025-02-08 14:51:57,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048816304] [2025-02-08 14:51:57,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:57,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:57,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048816304] [2025-02-08 14:51:57,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048816304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617419531] [2025-02-08 14:51:57,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,248 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 8 times [2025-02-08 14:51:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664382611] [2025-02-08 14:51:57,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:57,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:57,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:57,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:57,286 INFO L87 Difference]: Start difference. First operand 1775 states and 2936 transitions. cyclomatic complexity: 1192 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,324 INFO L93 Difference]: Finished difference Result 1619 states and 2441 transitions. [2025-02-08 14:51:57,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2441 transitions. [2025-02-08 14:51:57,330 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:57,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1619 states and 2441 transitions. [2025-02-08 14:51:57,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1619 [2025-02-08 14:51:57,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1619 [2025-02-08 14:51:57,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1619 states and 2441 transitions. [2025-02-08 14:51:57,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1619 states and 2441 transitions. [2025-02-08 14:51:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states and 2441 transitions. [2025-02-08 14:51:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1268. [2025-02-08 14:51:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1268 states have (on average 1.5599369085173502) internal successors, (1978), 1267 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1978 transitions. [2025-02-08 14:51:57,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1268 states and 1978 transitions. [2025-02-08 14:51:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:57,393 INFO L432 stractBuchiCegarLoop]: Abstraction has 1268 states and 1978 transitions. [2025-02-08 14:51:57,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-08 14:51:57,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1268 states and 1978 transitions. [2025-02-08 14:51:57,398 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,400 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_neg_edge~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:57,400 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume 0 == ~N_generate_st~0;" [2025-02-08 14:51:57,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1382450090, now seen corresponding path program 1 times [2025-02-08 14:51:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967508788] [2025-02-08 14:51:57,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:57,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:57,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967508788] [2025-02-08 14:51:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967508788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139727450] [2025-02-08 14:51:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,456 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 9 times [2025-02-08 14:51:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859977254] [2025-02-08 14:51:57,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:57,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:57,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:57,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:57,494 INFO L87 Difference]: Start difference. First operand 1268 states and 1978 transitions. cyclomatic complexity: 741 Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,546 INFO L93 Difference]: Finished difference Result 2330 states and 3539 transitions. [2025-02-08 14:51:57,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2330 states and 3539 transitions. [2025-02-08 14:51:57,556 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 809 [2025-02-08 14:51:57,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2330 states to 2330 states and 3539 transitions. [2025-02-08 14:51:57,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2330 [2025-02-08 14:51:57,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2330 [2025-02-08 14:51:57,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2330 states and 3539 transitions. [2025-02-08 14:51:57,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,573 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2330 states and 3539 transitions. [2025-02-08 14:51:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states and 3539 transitions. [2025-02-08 14:51:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 1268. [2025-02-08 14:51:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1268 states have (on average 1.5354889589905363) internal successors, (1947), 1267 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1947 transitions. [2025-02-08 14:51:57,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1268 states and 1947 transitions. [2025-02-08 14:51:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:57,601 INFO L432 stractBuchiCegarLoop]: Abstraction has 1268 states and 1947 transitions. [2025-02-08 14:51:57,601 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-08 14:51:57,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1268 states and 1947 transitions. [2025-02-08 14:51:57,605 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,606 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume 1 == ~main_clk_req_up~0;" "assume ~main_clk_val~0 != ~main_clk_val_t~0;~main_clk_val~0 := ~main_clk_val_t~0;~main_clk_ev~0 := 0;" "assume 1 == ~main_clk_val~0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 2;" "~main_clk_req_up~0 := 0;" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1;" "assume !(0 == ~main_clk_neg_edge~0);" "assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0;" "assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0;" "assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0;" "assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0;" "assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0;" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_neg_edge~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:57,606 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~N_generate_st~0;" "assume 0 == ~N_generate_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~S1_addsub_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume 0 == ~S2_presdbl_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___1~0#1);" "assume 0 == ~S3_zero_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1;" "assume !(0 != eval_~tmp___2~0#1);" "assume 0 == ~D_print_st~0;havoc eval_#t~nondet8#1;eval_~tmp___3~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1;" "assume !(0 != eval_~tmp___3~0#1);" [2025-02-08 14:51:57,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1631657648, now seen corresponding path program 1 times [2025-02-08 14:51:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190838578] [2025-02-08 14:51:57,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:51:57,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:51:57,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190838578] [2025-02-08 14:51:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190838578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058136617] [2025-02-08 14:51:57,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,638 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,639 INFO L85 PathProgramCache]: Analyzing trace with hash -635268902, now seen corresponding path program 1 times [2025-02-08 14:51:57,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481718721] [2025-02-08 14:51:57,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:57,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:57,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:57,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:57,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,685 INFO L87 Difference]: Start difference. First operand 1268 states and 1947 transitions. cyclomatic complexity: 710 Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,688 INFO L93 Difference]: Finished difference Result 332 states and 449 transitions. [2025-02-08 14:51:57,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 449 transitions. [2025-02-08 14:51:57,690 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 163 [2025-02-08 14:51:57,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 449 transitions. [2025-02-08 14:51:57,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2025-02-08 14:51:57,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2025-02-08 14:51:57,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 449 transitions. [2025-02-08 14:51:57,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 449 transitions. [2025-02-08 14:51:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 449 transitions. [2025-02-08 14:51:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-08 14:51:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 1.3524096385542168) internal successors, (449), 331 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2025-02-08 14:51:57,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 449 transitions. [2025-02-08 14:51:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,698 INFO L432 stractBuchiCegarLoop]: Abstraction has 332 states and 449 transitions. [2025-02-08 14:51:57,699 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-08 14:51:57,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 449 transitions. [2025-02-08 14:51:57,700 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 163 [2025-02-08 14:51:57,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,702 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_neg_edge~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume !(0 == ~N_generate_st~0);" "assume 0 == ~S1_addsub_st~0;" [2025-02-08 14:51:57,703 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == ~N_generate_st~0);" "assume 0 == ~S1_addsub_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume !(0 == ~N_generate_st~0);" "assume 0 == ~S1_addsub_st~0;" [2025-02-08 14:51:57,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash -93719475, now seen corresponding path program 1 times [2025-02-08 14:51:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852900254] [2025-02-08 14:51:57,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:51:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:51:57,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:57,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852900254] [2025-02-08 14:51:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852900254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498126521] [2025-02-08 14:51:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,754 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1820356983, now seen corresponding path program 2 times [2025-02-08 14:51:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62200160] [2025-02-08 14:51:57,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:57,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:57,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:57,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:57,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:57,792 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. cyclomatic complexity: 132 Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,844 INFO L93 Difference]: Finished difference Result 438 states and 572 transitions. [2025-02-08 14:51:57,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 572 transitions. [2025-02-08 14:51:57,846 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 237 [2025-02-08 14:51:57,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 438 states and 572 transitions. [2025-02-08 14:51:57,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2025-02-08 14:51:57,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2025-02-08 14:51:57,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 572 transitions. [2025-02-08 14:51:57,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 438 states and 572 transitions. [2025-02-08 14:51:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 572 transitions. [2025-02-08 14:51:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 248. [2025-02-08 14:51:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 248 states have (on average 1.3629032258064515) internal successors, (338), 247 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 338 transitions. [2025-02-08 14:51:57,854 INFO L240 hiAutomatonCegarLoop]: Abstraction has 248 states and 338 transitions. [2025-02-08 14:51:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:57,855 INFO L432 stractBuchiCegarLoop]: Abstraction has 248 states and 338 transitions. [2025-02-08 14:51:57,855 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-08 14:51:57,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 338 transitions. [2025-02-08 14:51:57,855 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 79 [2025-02-08 14:51:57,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,856 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_neg_edge~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume 0 == ~S2_presdbl_st~0;" [2025-02-08 14:51:57,856 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume 0 == ~S2_presdbl_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___1~0#1);" "assume !(0 == ~S3_zero_st~0);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume 0 == ~S2_presdbl_st~0;" [2025-02-08 14:51:57,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1389664264, now seen corresponding path program 1 times [2025-02-08 14:51:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961847853] [2025-02-08 14:51:57,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:51:57,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:51:57,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:57,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961847853] [2025-02-08 14:51:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961847853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596850406] [2025-02-08 14:51:57,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,904 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -8102544, now seen corresponding path program 2 times [2025-02-08 14:51:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918267171] [2025-02-08 14:51:57,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:57,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:51:57,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:57,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:57,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:51:57,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:57,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:57,940 INFO L87 Difference]: Start difference. First operand 248 states and 338 transitions. cyclomatic complexity: 97 Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,980 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2025-02-08 14:51:57,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 407 transitions. [2025-02-08 14:51:57,982 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 105 [2025-02-08 14:51:57,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 306 states and 407 transitions. [2025-02-08 14:51:57,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2025-02-08 14:51:57,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2025-02-08 14:51:57,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2025-02-08 14:51:57,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 306 states and 407 transitions. [2025-02-08 14:51:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2025-02-08 14:51:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 204. [2025-02-08 14:51:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.3872549019607843) internal successors, (283), 203 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2025-02-08 14:51:57,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-02-08 14:51:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:57,991 INFO L432 stractBuchiCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-02-08 14:51:57,991 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-08 14:51:57,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 283 transitions. [2025-02-08 14:51:57,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-02-08 14:51:57,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,993 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_neg_edge~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume 0 == ~S3_zero_st~0;" [2025-02-08 14:51:57,993 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume 0 == ~S3_zero_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1;" "assume !(0 != eval_~tmp___2~0#1);" "assume !(0 == ~D_print_st~0);" "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume 0 == ~S3_zero_st~0;" [2025-02-08 14:51:57,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash 129919915, now seen corresponding path program 1 times [2025-02-08 14:51:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717576921] [2025-02-08 14:51:57,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 14:51:58,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 14:51:58,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:58,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717576921] [2025-02-08 14:51:58,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717576921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946616317] [2025-02-08 14:51:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,047 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 337210215, now seen corresponding path program 2 times [2025-02-08 14:51:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320914739] [2025-02-08 14:51:58,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:58,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:58,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:58,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,085 INFO L87 Difference]: Start difference. First operand 204 states and 283 transitions. cyclomatic complexity: 82 Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,124 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2025-02-08 14:51:58,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 326 transitions. [2025-02-08 14:51:58,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-08 14:51:58,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 237 states and 326 transitions. [2025-02-08 14:51:58,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-02-08 14:51:58,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2025-02-08 14:51:58,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 326 transitions. [2025-02-08 14:51:58,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 237 states and 326 transitions. [2025-02-08 14:51:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 326 transitions. [2025-02-08 14:51:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 176. [2025-02-08 14:51:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 175 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 251 transitions. [2025-02-08 14:51:58,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 251 transitions. [2025-02-08 14:51:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:58,134 INFO L432 stractBuchiCegarLoop]: Abstraction has 176 states and 251 transitions. [2025-02-08 14:51:58,134 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-08 14:51:58,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 251 transitions. [2025-02-08 14:51:58,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:51:58,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,135 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~main_in1_req_up~0);" "assume !(1 == ~main_in2_req_up~0);" "assume !(1 == ~main_sum_req_up~0);" "assume !(1 == ~main_diff_req_up~0);" "assume !(1 == ~main_pres_req_up~0);" "assume !(1 == ~main_dbl_req_up~0);" "assume !(1 == ~main_zero_req_up~0);" "assume !(1 == ~main_clk_req_up~0);" "assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2;" "assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2;" "assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2;" "assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2;" "assume !(1 == ~D_print_i~0);~D_print_st~0 := 2;" "assume !(0 == ~main_in1_ev~0);" "assume !(0 == ~main_in2_ev~0);" "assume !(0 == ~main_sum_ev~0);" "assume !(0 == ~main_diff_ev~0);" "assume !(0 == ~main_pres_ev~0);" "assume !(0 == ~main_dbl_ev~0);" "assume !(0 == ~main_zero_ev~0);" "assume !(0 == ~main_clk_ev~0);" "assume !(0 == ~main_clk_pos_edge~0);" "assume !(0 == ~main_clk_neg_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_in1_ev~0);" "assume !(1 == ~main_in2_ev~0);" "assume !(1 == ~main_sum_ev~0);" "assume !(1 == ~main_diff_ev~0);" "assume !(1 == ~main_pres_ev~0);" "assume !(1 == ~main_dbl_ev~0);" "assume !(1 == ~main_zero_ev~0);" "assume !(1 == ~main_clk_ev~0);" "assume !(1 == ~main_clk_pos_edge~0);" "assume !(1 == ~main_clk_neg_edge~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-02-08 14:51:58,135 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume 0 == ~D_print_st~0;" "assume !(0 == ~N_generate_st~0);" "assume !(0 == ~S1_addsub_st~0);" "assume !(0 == ~S2_presdbl_st~0);" "assume !(0 == ~S3_zero_st~0);" "assume 0 == ~D_print_st~0;havoc eval_#t~nondet8#1;eval_~tmp___3~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1;" "assume !(0 != eval_~tmp___3~0#1);" [2025-02-08 14:51:58,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash 877415212, now seen corresponding path program 1 times [2025-02-08 14:51:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050732915] [2025-02-08 14:51:58,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:58,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:58,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:58,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:58,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 914158350, now seen corresponding path program 2 times [2025-02-08 14:51:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917364750] [2025-02-08 14:51:58,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:58,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:58,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:58,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:58,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -877472327, now seen corresponding path program 1 times [2025-02-08 14:51:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013367974] [2025-02-08 14:51:58,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 14:51:58,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 14:51:58,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:58,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013367974] [2025-02-08 14:51:58,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013367974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:51:58,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376740069] [2025-02-08 14:51:58,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,256 INFO L87 Difference]: Start difference. First operand 176 states and 251 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:51:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,287 INFO L93 Difference]: Finished difference Result 204 states and 290 transitions. [2025-02-08 14:51:58,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 290 transitions. [2025-02-08 14:51:58,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:51:58,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 0 states and 0 transitions. [2025-02-08 14:51:58,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:51:58,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:51:58,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:51:58,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:51:58,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:51:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:58,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:51:58,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-08 14:51:58,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:51:58,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:51:58,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:51:58,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:51:58 BoogieIcfgContainer [2025-02-08 14:51:58,297 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:51:58,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:51:58,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:51:58,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:51:58,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:54" (3/4) ... [2025-02-08 14:51:58,301 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:51:58,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:51:58,304 INFO L158 Benchmark]: Toolchain (without parser) took 5971.21ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 59.8MB in the end (delta: 53.9MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2025-02-08 14:51:58,304 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:58,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.65ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 97.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:51:58,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.84ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 93.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:58,305 INFO L158 Benchmark]: Boogie Preprocessor took 74.17ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 90.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:51:58,306 INFO L158 Benchmark]: IcfgBuilder took 1230.02ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 94.1MB in the end (delta: -3.8MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2025-02-08 14:51:58,307 INFO L158 Benchmark]: BuchiAutomizer took 4251.11ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 94.1MB in the beginning and 59.8MB in the end (delta: 34.3MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2025-02-08 14:51:58,307 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 176.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:58,309 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.65ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 97.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.84ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 93.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.17ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 90.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1230.02ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 94.1MB in the end (delta: -3.8MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 4251.11ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 94.1MB in the beginning and 59.8MB in the end (delta: 34.3MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 176.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 23 terminating modules (23 trivial, 0 deterministic, 0 nondeterministic). 23 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 24 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 23. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 3503 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4241 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4241 mSDsluCounter, 5143 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2336 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 2807 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN17 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:51:58,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE