./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pipeline.cil-2.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-2.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 c42f0f019aa30bac52b753d657fd0a7a27ad0fcef5ea61d179259276789b8861 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:51:52,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:51:52,481 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:52,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:51:52,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:51:52,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:51:52,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:51:52,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:51:52,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:51:52,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:51:52,518 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:51:52,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:51:52,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:51:52,518 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:51:52,518 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:51:52,518 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:51:52,518 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:51:52,518 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:51:52,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:51:52,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:51:52,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:51:52,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:51:52,519 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:51:52,520 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 -> c42f0f019aa30bac52b753d657fd0a7a27ad0fcef5ea61d179259276789b8861 [2025-02-08 14:51:52,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:51:52,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:51:52,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:51:52,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:51:52,770 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:51:52,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pipeline.cil-2.c [2025-02-08 14:51:53,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a2dc19dd/c08b8ea762f24ec1955765925c6c313c/FLAGd0f929b99 [2025-02-08 14:51:54,211 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:51:54,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-2.c [2025-02-08 14:51:54,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a2dc19dd/c08b8ea762f24ec1955765925c6c313c/FLAGd0f929b99 [2025-02-08 14:51:54,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a2dc19dd/c08b8ea762f24ec1955765925c6c313c [2025-02-08 14:51:54,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:51:54,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:51:54,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:54,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:51:54,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:51:54,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:54" (1/1) ... [2025-02-08 14:51:54,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d1c612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:54, skipping insertion in model container [2025-02-08 14:51:54,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:54" (1/1) ... [2025-02-08 14:51:54,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:51:54,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:54,702 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:51:54,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:54,762 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:51:54,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:54 WrapperNode [2025-02-08 14:51:54,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:54,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:54,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:51:54,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:51:54,768 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:54" (1/1) ... [2025-02-08 14:51:54,776 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:54" (1/1) ... [2025-02-08 14:51:54,800 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 13, calls inlined = 25, statements flattened = 1031 [2025-02-08 14:51:54,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:54,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:51:54,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:51:54,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:51:54,808 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:54" (1/1) ... [2025-02-08 14:51:54,808 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:54" (1/1) ... [2025-02-08 14:51:54,812 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:54" (1/1) ... [2025-02-08 14:51:54,823 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:54,823 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:54" (1/1) ... [2025-02-08 14:51:54,823 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:54" (1/1) ... [2025-02-08 14:51:54,831 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:54" (1/1) ... [2025-02-08 14:51:54,832 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:54" (1/1) ... [2025-02-08 14:51:54,833 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:54" (1/1) ... [2025-02-08 14:51:54,834 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:54" (1/1) ... [2025-02-08 14:51:54,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:51:54,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:51:54,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:51:54,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:51:54,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:54" (1/1) ... [2025-02-08 14:51:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:51:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:54,860 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:54,862 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:54,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:51:54,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:51:54,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:51:54,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:51:54,953 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:51:54,955 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:51:55,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; [2025-02-08 14:51:55,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:55,721 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:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-1: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:55,722 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:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-2: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-1: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-1: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-1: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-1: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:55,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-2: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564-2: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-2: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L531-2: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: assume 1 == ~S3_zero_i~0;~S3_zero_st~0 := 0; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:55,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:55,724 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:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:55,724 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:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:55,724 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:55,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:55,724 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:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-1: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:55,725 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:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; [2025-02-08 14:51:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:55,725 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:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-2: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:55,725 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:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:55,725 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:55,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:55,725 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:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:55,726 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:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:55,726 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:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,726 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:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,726 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:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L665-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; [2025-02-08 14:51:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: assume !(0 == ~main_dbl_ev~0); [2025-02-08 14:51:55,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236: assume { :end_inline_D_print } true; [2025-02-08 14:51:55,727 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:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: assume !(0 != eval_~tmp___1~0#1); [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236-1: assume { :end_inline_D_print } true; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236-2: assume { :end_inline_D_print } true; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600-1: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600-2: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:55,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:55,728 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:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:55,728 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:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-2: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:55,728 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:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L502: assume !true; [2025-02-08 14:51:55,728 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:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L436: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,728 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:55,728 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:55,728 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:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; [2025-02-08 14:51:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:55,728 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:55,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635-1: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:55,728 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:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635-2: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume 1 == ~D_print_i~0;~D_print_st~0 := 0; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; [2025-02-08 14:51:55,729 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:55,729 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:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: assume !(0 != eval_~tmp~0#1); [2025-02-08 14:51:55,729 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:55,729 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:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: assume !(1 == ~main_pres_ev~0); [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:55,729 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:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:55,729 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:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:55,729 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:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L670-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-1: start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:55,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:55,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-1: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:55,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-2: start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:55,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538-1: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:55,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-2: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:55,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538-2: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:55,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: assume !(0 == ~main_zero_ev~0); [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L274: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume 5 == main_~count~0#1; [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume !(5 == main_~count~0#1); [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; [2025-02-08 14:51:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:55,731 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:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605-1: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:55,731 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:55,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L605-2: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:55,731 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:55,731 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:55,732 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:55,732 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:55,732 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:55,732 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:55,732 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:55,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L804: assume !!(0 == ~D_z~0); [2025-02-08 14:51:55,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; [2025-02-08 14:51:55,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:55,732 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:55,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-1: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:55,732 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:55,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-2: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:55,733 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:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:55,733 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:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640-1: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:55,733 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:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640-2: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:55,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: assume !(0 == ~main_in1_ev~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: assume { :end_inline_error } true; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-1: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-1: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-1: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-1: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-2: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-2: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L476: assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L476: assume !(1 == ~main_dbl_ev~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-1: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-1: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-2: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-2: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-2: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-2: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: assume 1 == ~main_dbl_req_up~0; [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: assume !(1 == ~main_dbl_req_up~0); [2025-02-08 14:51:55,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: assume 1 == ~main_sum_req_up~0; [2025-02-08 14:51:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: assume !(1 == ~main_sum_req_up~0); [2025-02-08 14:51:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: assume true; [2025-02-08 14:51:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: assume !true; [2025-02-08 14:51:55,735 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:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,735 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:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,735 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:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,735 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:55,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-1: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-1: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-2: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510-1: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:55,736 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:55,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-2: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510-2: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: assume !(0 == ~main_clk_ev~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume !(~main_dbl_val~0 != ~main_dbl_val_t~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: assume !(~main_sum_val~0 != ~main_sum_val_t~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume 0 == ~D_print_st~0; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume 0 == ~D_print_st~0; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume 0 == ~D_print_st~0; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-1: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-2: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148: assume 0 == ~N_generate_st~0; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148: assume !(0 == ~N_generate_st~0); [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; [2025-02-08 14:51:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:55,737 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:55,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L347: ~main_clk_req_up~0 := 0; [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-2: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: assume !(0 == ~main_in2_ev~0); [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L811: main_~count~0#1 := 0; [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: assume !(1 == ~main_zero_ev~0); [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: assume 0 == ~S1_addsub_st~0; [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: assume !(0 == ~S1_addsub_st~0); [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; [2025-02-08 14:51:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:55,738 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:55,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680-1: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:55,739 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:55,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L680-2: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:55,739 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:55,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(0 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,739 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:55,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume !(0 != eval_~tmp___2~0#1); [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:55,740 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:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L549: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582-1: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:55,740 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:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-1: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:55,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582-2: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-1: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-2: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-2: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: assume 1 == ~N_generate_i~0;~N_generate_st~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: ~main_dbl_req_up~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: ~main_sum_req_up~0 := 0; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:55,741 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:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:55,741 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:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-2: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:55,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L451: assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; [2025-02-08 14:51:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L451: assume !(1 == ~main_in1_ev~0); [2025-02-08 14:51:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: assume 0 == ~S2_presdbl_st~0; [2025-02-08 14:51:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:55,742 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:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,742 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:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650-1: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,742 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:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650-2: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; [2025-02-08 14:51:55,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: assume !(0 == ~main_sum_ev~0); [2025-02-08 14:51:55,742 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:55,742 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:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: assume !(0 != eval_~tmp___0~0#1); [2025-02-08 14:51:55,743 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:55,743 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:55,743 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:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: assume !(1 == ~main_clk_ev~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:55,743 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:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-1: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:55,743 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:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-2: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-1: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-1: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-1: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-1: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-2: assume 1 == ~main_clk_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L586-2: assume !(1 == ~main_clk_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-1: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-1: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:55,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-2: assume 1 == ~main_pres_req_up~0; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-2: assume !(1 == ~main_pres_req_up~0); [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-2: assume 1 == ~main_in2_req_up~0; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520-2: assume !(1 == ~main_in2_req_up~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: assume !(0 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume 1 == ~main_zero_req_up~0; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume !(1 == ~main_zero_req_up~0); [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: assume 1 == ~main_diff_req_up~0; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: assume !(1 == ~main_diff_req_up~0); [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: assume 1 == ~main_in1_req_up~0; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: assume !(1 == ~main_in1_req_up~0); [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: assume 0 == ~S3_zero_st~0; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: assume !(0 == ~S3_zero_st~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; [2025-02-08 14:51:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-1: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587-1: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-2: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:55,744 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:55,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554-1: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:55,744 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:55,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587-2: assume !(~main_clk_val~0 != ~main_clk_val_t~0); [2025-02-08 14:51:55,745 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:55,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521-1: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:55,745 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:55,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554-2: assume !(~main_pres_val~0 != ~main_pres_val_t~0); [2025-02-08 14:51:55,745 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:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L521-2: assume !(~main_in2_val~0 != ~main_in2_val_t~0); [2025-02-08 14:51:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume 1 == ~S1_addsub_i~0;~S1_addsub_st~0 := 0; [2025-02-08 14:51:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; [2025-02-08 14:51:55,746 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:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume !(~main_zero_val~0 != ~main_zero_val_t~0); [2025-02-08 14:51:55,746 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:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: assume !(~main_diff_val~0 != ~main_diff_val_t~0); [2025-02-08 14:51:55,746 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:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L257: assume !(~main_in1_val~0 != ~main_in1_val_t~0); [2025-02-08 14:51:55,746 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:55,746 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:55,746 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:55,746 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:55,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,746 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:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,747 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:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; [2025-02-08 14:51:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume !(1 == ~main_in2_ev~0); [2025-02-08 14:51:55,747 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:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,747 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:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,747 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:55,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume !(0 == ~main_diff_ev~0); [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: assume 0 == ~D_print_st~0; [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:55,748 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:55,748 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:55,748 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:55,748 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:55,748 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:55,748 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:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L491: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-1: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-2: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L426: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-2: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0; [2025-02-08 14:51:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; [2025-02-08 14:51:55,748 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:55,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: assume !(0 == ~D_print_st~0); [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-2: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-2: ~main_pres_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: assume !(1 == ~main_sum_ev~0); [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-2: ~main_in2_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: ~main_zero_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L296: ~main_diff_req_up~0 := 0; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: ~main_in1_req_up~0 := 0; [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660-1: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L660-2: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; [2025-02-08 14:51:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: assume !(0 == ~main_pres_ev~0); [2025-02-08 14:51:55,749 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:55,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: assume !(1 == ~main_clk_neg_edge~0); [2025-02-08 14:51:55,750 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:55,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: assume !(0 == ~S2_presdbl_st~0); [2025-02-08 14:51:55,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; [2025-02-08 14:51:55,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:55,750 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:55,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-1: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:55,750 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:55,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-2: assume !(1 == ~main_diff_ev~0); [2025-02-08 14:51:55,750 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:55,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: assume !(1 == ~main_clk_pos_edge~0); [2025-02-08 14:51:55,751 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:55,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L233: assume !(0 != eval_~tmp___3~0#1); [2025-02-08 14:51:55,785 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-08 14:51:55,785 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:51:55,793 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:51:55,794 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:51:55,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:55 BoogieIcfgContainer [2025-02-08 14:51:55,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:51:55,795 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:51:55,795 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:51:55,799 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:51:55,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:55,800 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:51:54" (1/3) ... [2025-02-08 14:51:55,800 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c791ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:55, skipping insertion in model container [2025-02-08 14:51:55,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:55,800 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:54" (2/3) ... [2025-02-08 14:51:55,800 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c791ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:55, skipping insertion in model container [2025-02-08 14:51:55,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:55,801 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:55" (3/3) ... [2025-02-08 14:51:55,801 INFO L363 chiAutomizerObserver]: Analyzing ICFG pipeline.cil-2.c [2025-02-08 14:51:55,845 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:51:55,845 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:51:55,845 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:51:55,845 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:51:55,845 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:51:55,845 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:51:55,845 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:51:55,845 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:51:55,860 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:55,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-08 14:51:55,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,893 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,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:51:55,897 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:55,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-08 14:51:55,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,906 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,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:55,914 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:55,914 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:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2039981232, now seen corresponding path program 1 times [2025-02-08 14:51:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879193082] [2025-02-08 14:51:55,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,041 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,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,176 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,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879193082] [2025-02-08 14:51:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879193082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12805518] [2025-02-08 14:51:56,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,185 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 107793701, now seen corresponding path program 1 times [2025-02-08 14:51:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128036714] [2025-02-08 14:51:56,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:51:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:51:56,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,201 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,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128036714] [2025-02-08 14:51:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128036714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027990790] [2025-02-08 14:51:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,202 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:56,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,223 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:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,254 INFO L93 Difference]: Finished difference Result 124 states and 213 transitions. [2025-02-08 14:51:56,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 213 transitions. [2025-02-08 14:51:56,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 114 states and 203 transitions. [2025-02-08 14:51:56,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2025-02-08 14:51:56,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-02-08 14:51:56,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 203 transitions. [2025-02-08 14:51:56,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 203 transitions. [2025-02-08 14:51:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 203 transitions. [2025-02-08 14:51:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-08 14:51:56,294 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:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 203 transitions. [2025-02-08 14:51:56,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 203 transitions. [2025-02-08 14:51:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,302 INFO L432 stractBuchiCegarLoop]: Abstraction has 114 states and 203 transitions. [2025-02-08 14:51:56,302 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:51:56,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 203 transitions. [2025-02-08 14:51:56,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,304 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,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,304 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:56,304 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:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1689181295, now seen corresponding path program 1 times [2025-02-08 14:51:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217244067] [2025-02-08 14:51:56,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,325 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,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,378 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,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217244067] [2025-02-08 14:51:56,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217244067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943068282] [2025-02-08 14:51:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,378 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 1 times [2025-02-08 14:51:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465748416] [2025-02-08 14:51:56,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,383 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,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,385 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,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,443 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:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,458 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2025-02-08 14:51:56,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 172 transitions. [2025-02-08 14:51:56,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 172 transitions. [2025-02-08 14:51:56,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-02-08 14:51:56,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2025-02-08 14:51:56,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 172 transitions. [2025-02-08 14:51:56,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 172 transitions. [2025-02-08 14:51:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 172 transitions. [2025-02-08 14:51:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 14:51:56,469 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:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 172 transitions. [2025-02-08 14:51:56,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 172 transitions. [2025-02-08 14:51:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,471 INFO L432 stractBuchiCegarLoop]: Abstraction has 99 states and 172 transitions. [2025-02-08 14:51:56,471 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:51:56,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 172 transitions. [2025-02-08 14:51:56,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,472 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,472 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,472 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:56,472 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:56,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1744451887, now seen corresponding path program 1 times [2025-02-08 14:51:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965732173] [2025-02-08 14:51:56,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,488 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,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,548 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,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965732173] [2025-02-08 14:51:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965732173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437834271] [2025-02-08 14:51:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,549 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 2 times [2025-02-08 14:51:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135839478] [2025-02-08 14:51:56,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,553 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:56,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,554 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,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,580 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:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,593 INFO L93 Difference]: Finished difference Result 195 states and 336 transitions. [2025-02-08 14:51:56,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 336 transitions. [2025-02-08 14:51:56,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-08 14:51:56,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 336 transitions. [2025-02-08 14:51:56,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2025-02-08 14:51:56,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2025-02-08 14:51:56,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 336 transitions. [2025-02-08 14:51:56,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 336 transitions. [2025-02-08 14:51:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 336 transitions. [2025-02-08 14:51:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 148. [2025-02-08 14:51:56,605 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:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2025-02-08 14:51:56,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 258 transitions. [2025-02-08 14:51:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,608 INFO L432 stractBuchiCegarLoop]: Abstraction has 148 states and 258 transitions. [2025-02-08 14:51:56,609 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:51:56,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 258 transitions. [2025-02-08 14:51:56,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,610 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,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,610 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:56,613 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:56,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1713432080, now seen corresponding path program 1 times [2025-02-08 14:51:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766570728] [2025-02-08 14:51:56,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,625 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,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,691 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,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766570728] [2025-02-08 14:51:56,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766570728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089040750] [2025-02-08 14:51:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,691 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 3 times [2025-02-08 14:51:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887564328] [2025-02-08 14:51:56,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,695 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:56,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:56,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,696 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,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:56,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:56,721 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:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,778 INFO L93 Difference]: Finished difference Result 252 states and 437 transitions. [2025-02-08 14:51:56,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 437 transitions. [2025-02-08 14:51:56,779 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-08 14:51:56,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 252 states and 437 transitions. [2025-02-08 14:51:56,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2025-02-08 14:51:56,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2025-02-08 14:51:56,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 437 transitions. [2025-02-08 14:51:56,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 252 states and 437 transitions. [2025-02-08 14:51:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 437 transitions. [2025-02-08 14:51:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 178. [2025-02-08 14:51:56,790 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:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 311 transitions. [2025-02-08 14:51:56,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 311 transitions. [2025-02-08 14:51:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:56,793 INFO L432 stractBuchiCegarLoop]: Abstraction has 178 states and 311 transitions. [2025-02-08 14:51:56,793 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:51:56,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 311 transitions. [2025-02-08 14:51:56,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,798 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,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,798 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:56,798 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:56,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1584462863, now seen corresponding path program 1 times [2025-02-08 14:51:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916906393] [2025-02-08 14:51:56,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,806 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,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,835 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,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916906393] [2025-02-08 14:51:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916906393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766320246] [2025-02-08 14:51:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,835 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -978112302, now seen corresponding path program 4 times [2025-02-08 14:51:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474689644] [2025-02-08 14:51:56,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,838 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:51:56,838 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:56,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:56,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:56,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,839 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,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:56,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,864 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:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,894 INFO L93 Difference]: Finished difference Result 231 states and 389 transitions. [2025-02-08 14:51:56,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 389 transitions. [2025-02-08 14:51:56,895 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-08 14:51:56,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 231 states and 389 transitions. [2025-02-08 14:51:56,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2025-02-08 14:51:56,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2025-02-08 14:51:56,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 389 transitions. [2025-02-08 14:51:56,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 389 transitions. [2025-02-08 14:51:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 389 transitions. [2025-02-08 14:51:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 200. [2025-02-08 14:51:56,905 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:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 343 transitions. [2025-02-08 14:51:56,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 200 states and 343 transitions. [2025-02-08 14:51:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:56,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 200 states and 343 transitions. [2025-02-08 14:51:56,906 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:51:56,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 343 transitions. [2025-02-08 14:51:56,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-08 14:51:56,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:56,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:56,908 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,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:56,908 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,908 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:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 1 times [2025-02-08 14:51:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722656882] [2025-02-08 14:51:56,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:56,921 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,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,962 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,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722656882] [2025-02-08 14:51:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722656882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484119088] [2025-02-08 14:51:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,962 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 168900780, now seen corresponding path program 1 times [2025-02-08 14:51:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007058434] [2025-02-08 14:51:56,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:56,965 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,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:56,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,971 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,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007058434] [2025-02-08 14:51:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007058434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061529365] [2025-02-08 14:51:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:56,971 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:56,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:56,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:56,972 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:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:56,983 INFO L93 Difference]: Finished difference Result 336 states and 581 transitions. [2025-02-08 14:51:56,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 336 states and 581 transitions. [2025-02-08 14:51:56,995 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:56,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 336 states to 336 states and 581 transitions. [2025-02-08 14:51:56,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-02-08 14:51:56,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-02-08 14:51:56,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 581 transitions. [2025-02-08 14:51:56,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:56,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 336 states and 581 transitions. [2025-02-08 14:51:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 581 transitions. [2025-02-08 14:51:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-08 14:51:57,008 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:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 581 transitions. [2025-02-08 14:51:57,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 336 states and 581 transitions. [2025-02-08 14:51:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,013 INFO L432 stractBuchiCegarLoop]: Abstraction has 336 states and 581 transitions. [2025-02-08 14:51:57,013 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:51:57,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 581 transitions. [2025-02-08 14:51:57,015 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:57,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,015 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:57,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,016 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:57,016 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:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1062612559, now seen corresponding path program 1 times [2025-02-08 14:51:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780099600] [2025-02-08 14:51:57,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:57,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:57,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,062 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,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780099600] [2025-02-08 14:51:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780099600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195570293] [2025-02-08 14:51:57,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,063 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 940159111, now seen corresponding path program 1 times [2025-02-08 14:51:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536497829] [2025-02-08 14:51:57,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:57,065 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,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:57,070 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,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,146 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:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,153 INFO L93 Difference]: Finished difference Result 258 states and 437 transitions. [2025-02-08 14:51:57,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 437 transitions. [2025-02-08 14:51:57,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:57,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 437 transitions. [2025-02-08 14:51:57,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2025-02-08 14:51:57,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2025-02-08 14:51:57,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 437 transitions. [2025-02-08 14:51:57,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 437 transitions. [2025-02-08 14:51:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 437 transitions. [2025-02-08 14:51:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-08 14:51:57,166 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:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 437 transitions. [2025-02-08 14:51:57,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 258 states and 437 transitions. [2025-02-08 14:51:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,171 INFO L432 stractBuchiCegarLoop]: Abstraction has 258 states and 437 transitions. [2025-02-08 14:51:57,171 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:51:57,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 437 transitions. [2025-02-08 14:51:57,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-02-08 14:51:57,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,173 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:57,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,173 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:57,173 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:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 2 times [2025-02-08 14:51:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987200364] [2025-02-08 14:51:57,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:57,189 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:57,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:57,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,219 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,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987200364] [2025-02-08 14:51:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987200364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475328966] [2025-02-08 14:51:57,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,220 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2005961927, now seen corresponding path program 1 times [2025-02-08 14:51:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761700166] [2025-02-08 14:51:57,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:57,223 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,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,231 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,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761700166] [2025-02-08 14:51:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761700166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485586745] [2025-02-08 14:51:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,236 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,236 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:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,259 INFO L93 Difference]: Finished difference Result 447 states and 763 transitions. [2025-02-08 14:51:57,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 447 states and 763 transitions. [2025-02-08 14:51:57,266 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:57,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 447 states to 447 states and 763 transitions. [2025-02-08 14:51:57,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 447 [2025-02-08 14:51:57,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2025-02-08 14:51:57,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 447 states and 763 transitions. [2025-02-08 14:51:57,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 447 states and 763 transitions. [2025-02-08 14:51:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states and 763 transitions. [2025-02-08 14:51:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-02-08 14:51:57,282 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:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 763 transitions. [2025-02-08 14:51:57,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 447 states and 763 transitions. [2025-02-08 14:51:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 447 states and 763 transitions. [2025-02-08 14:51:57,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:51:57,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 763 transitions. [2025-02-08 14:51:57,291 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:57,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,295 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:57,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,295 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:57,295 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:57,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash 380826989, now seen corresponding path program 1 times [2025-02-08 14:51:57,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020751091] [2025-02-08 14:51:57,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:57,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:57,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,333 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,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020751091] [2025-02-08 14:51:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020751091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094492667] [2025-02-08 14:51:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,334 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2055252464, now seen corresponding path program 1 times [2025-02-08 14:51:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963062577] [2025-02-08 14:51:57,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:57,337 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,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:57,338 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,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:57,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:57,371 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:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,384 INFO L93 Difference]: Finished difference Result 361 states and 603 transitions. [2025-02-08 14:51:57,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 603 transitions. [2025-02-08 14:51:57,387 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:57,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 361 states and 603 transitions. [2025-02-08 14:51:57,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 361 [2025-02-08 14:51:57,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2025-02-08 14:51:57,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 603 transitions. [2025-02-08 14:51:57,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-08 14:51:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 603 transitions. [2025-02-08 14:51:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-08 14:51:57,394 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:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2025-02-08 14:51:57,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-08 14:51:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,395 INFO L432 stractBuchiCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-08 14:51:57,396 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:51:57,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 603 transitions. [2025-02-08 14:51:57,397 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 92 [2025-02-08 14:51:57,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,398 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:57,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,398 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:57,398 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:57,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 3 times [2025-02-08 14:51:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114297038] [2025-02-08 14:51:57,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:57,405 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:57,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:57,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,441 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,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114297038] [2025-02-08 14:51:57,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114297038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040677813] [2025-02-08 14:51:57,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,442 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1231942962, now seen corresponding path program 1 times [2025-02-08 14:51:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151054160] [2025-02-08 14:51:57,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:57,449 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,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,458 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,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151054160] [2025-02-08 14:51:57,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151054160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071402313] [2025-02-08 14:51:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,461 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,462 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:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,479 INFO L93 Difference]: Finished difference Result 650 states and 1093 transitions. [2025-02-08 14:51:57,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 1093 transitions. [2025-02-08 14:51:57,483 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:57,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 650 states and 1093 transitions. [2025-02-08 14:51:57,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 650 [2025-02-08 14:51:57,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2025-02-08 14:51:57,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 1093 transitions. [2025-02-08 14:51:57,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 1093 transitions. [2025-02-08 14:51:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 1093 transitions. [2025-02-08 14:51:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2025-02-08 14:51:57,495 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:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1093 transitions. [2025-02-08 14:51:57,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 650 states and 1093 transitions. [2025-02-08 14:51:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,498 INFO L432 stractBuchiCegarLoop]: Abstraction has 650 states and 1093 transitions. [2025-02-08 14:51:57,498 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:51:57,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 650 states and 1093 transitions. [2025-02-08 14:51:57,501 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:57,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,501 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:57,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,502 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:57,502 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:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1328665231, now seen corresponding path program 1 times [2025-02-08 14:51:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032402077] [2025-02-08 14:51:57,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:57,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:57,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,525 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,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032402077] [2025-02-08 14:51:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032402077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38405125] [2025-02-08 14:51:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,526 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash 464473637, now seen corresponding path program 1 times [2025-02-08 14:51:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706243362] [2025-02-08 14:51:57,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:57,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:57,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:57,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:57,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,555 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:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,559 INFO L93 Difference]: Finished difference Result 556 states and 917 transitions. [2025-02-08 14:51:57,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 917 transitions. [2025-02-08 14:51:57,563 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:57,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 556 states and 917 transitions. [2025-02-08 14:51:57,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 556 [2025-02-08 14:51:57,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 556 [2025-02-08 14:51:57,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 917 transitions. [2025-02-08 14:51:57,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 556 states and 917 transitions. [2025-02-08 14:51:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 917 transitions. [2025-02-08 14:51:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-02-08 14:51:57,573 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:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 917 transitions. [2025-02-08 14:51:57,575 INFO L240 hiAutomatonCegarLoop]: Abstraction has 556 states and 917 transitions. [2025-02-08 14:51:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,576 INFO L432 stractBuchiCegarLoop]: Abstraction has 556 states and 917 transitions. [2025-02-08 14:51:57,576 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:51:57,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 556 states and 917 transitions. [2025-02-08 14:51:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 175 [2025-02-08 14:51:57,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,579 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:57,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,579 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:57,579 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:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928686, now seen corresponding path program 4 times [2025-02-08 14:51:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681700552] [2025-02-08 14:51:57,580 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-08 14:51:57,586 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:57,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:57,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,609 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,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681700552] [2025-02-08 14:51:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681700552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56892840] [2025-02-08 14:51:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,610 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1414962281, now seen corresponding path program 1 times [2025-02-08 14:51:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451617008] [2025-02-08 14:51:57,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:57,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:51:57,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,618 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,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451617008] [2025-02-08 14:51:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451617008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577516854] [2025-02-08 14:51:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,619 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,620 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:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,633 INFO L93 Difference]: Finished difference Result 1024 states and 1693 transitions. [2025-02-08 14:51:57,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1024 states and 1693 transitions. [2025-02-08 14:51:57,639 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1024 states to 1024 states and 1693 transitions. [2025-02-08 14:51:57,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1024 [2025-02-08 14:51:57,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1024 [2025-02-08 14:51:57,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1024 states and 1693 transitions. [2025-02-08 14:51:57,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1024 states and 1693 transitions. [2025-02-08 14:51:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states and 1693 transitions. [2025-02-08 14:51:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1023. [2025-02-08 14:51:57,658 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:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1692 transitions. [2025-02-08 14:51:57,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1023 states and 1692 transitions. [2025-02-08 14:51:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,661 INFO L432 stractBuchiCegarLoop]: Abstraction has 1023 states and 1692 transitions. [2025-02-08 14:51:57,662 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:51:57,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1023 states and 1692 transitions. [2025-02-08 14:51:57,666 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,667 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:57,667 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,667 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:57,667 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:57,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash 112314669, now seen corresponding path program 1 times [2025-02-08 14:51:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826256895] [2025-02-08 14:51:57,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:57,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:51:57,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,690 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,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826256895] [2025-02-08 14:51:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826256895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994400487] [2025-02-08 14:51:57,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,691 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 914158350, now seen corresponding path program 1 times [2025-02-08 14:51:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516731539] [2025-02-08 14:51:57,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:57,694 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,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:57,695 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,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:57,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:57,719 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:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,725 INFO L93 Difference]: Finished difference Result 901 states and 1460 transitions. [2025-02-08 14:51:57,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 901 states and 1460 transitions. [2025-02-08 14:51:57,730 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 901 states to 901 states and 1460 transitions. [2025-02-08 14:51:57,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 901 [2025-02-08 14:51:57,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 901 [2025-02-08 14:51:57,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 901 states and 1460 transitions. [2025-02-08 14:51:57,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 901 states and 1460 transitions. [2025-02-08 14:51:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states and 1460 transitions. [2025-02-08 14:51:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2025-02-08 14:51:57,745 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:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1460 transitions. [2025-02-08 14:51:57,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 901 states and 1460 transitions. [2025-02-08 14:51:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:57,749 INFO L432 stractBuchiCegarLoop]: Abstraction has 901 states and 1460 transitions. [2025-02-08 14:51:57,749 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:51:57,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 901 states and 1460 transitions. [2025-02-08 14:51:57,753 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,753 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,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,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);" "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:57,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:57,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1253337580, now seen corresponding path program 1 times [2025-02-08 14:51:57,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667951405] [2025-02-08 14:51:57,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 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 42 of 42 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 unsat [2025-02-08 14:51:57,786 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,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667951405] [2025-02-08 14:51:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667951405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018776562] [2025-02-08 14:51:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,787 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 5 times [2025-02-08 14:51:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054009834] [2025-02-08 14:51:57,788 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:51:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,790 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,791 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:57,791 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,792 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,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:57,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:57,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:57,815 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:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:57,860 INFO L93 Difference]: Finished difference Result 1520 states and 2356 transitions. [2025-02-08 14:51:57,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1520 states and 2356 transitions. [2025-02-08 14:51:57,868 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:57,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1520 states to 1520 states and 2356 transitions. [2025-02-08 14:51:57,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1520 [2025-02-08 14:51:57,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1520 [2025-02-08 14:51:57,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1520 states and 2356 transitions. [2025-02-08 14:51:57,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:57,876 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1520 states and 2356 transitions. [2025-02-08 14:51:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states and 2356 transitions. [2025-02-08 14:51:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1104. [2025-02-08 14:51:57,891 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:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1788 transitions. [2025-02-08 14:51:57,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1104 states and 1788 transitions. [2025-02-08 14:51:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:57,895 INFO L432 stractBuchiCegarLoop]: Abstraction has 1104 states and 1788 transitions. [2025-02-08 14:51:57,895 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-08 14:51:57,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1104 states and 1788 transitions. [2025-02-08 14:51:57,900 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:57,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:57,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:57,900 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,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:57,900 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:57,900 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,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 291723563, now seen corresponding path program 1 times [2025-02-08 14:51:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386679583] [2025-02-08 14:51:57,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:57,907 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,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,979 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,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386679583] [2025-02-08 14:51:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386679583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234408150] [2025-02-08 14:51:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:57,979 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 6 times [2025-02-08 14:51:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543313039] [2025-02-08 14:51:57,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:51:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:57,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,982 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:57,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:51:57,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:57,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:57,987 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,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:57,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:57,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:58,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:58,023 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:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,065 INFO L93 Difference]: Finished difference Result 1911 states and 3032 transitions. [2025-02-08 14:51:58,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1911 states and 3032 transitions. [2025-02-08 14:51:58,081 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:58,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1911 states to 1911 states and 3032 transitions. [2025-02-08 14:51:58,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1911 [2025-02-08 14:51:58,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1911 [2025-02-08 14:51:58,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1911 states and 3032 transitions. [2025-02-08 14:51:58,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1911 states and 3032 transitions. [2025-02-08 14:51:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states and 3032 transitions. [2025-02-08 14:51:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1170. [2025-02-08 14:51:58,127 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:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1878 transitions. [2025-02-08 14:51:58,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1878 transitions. [2025-02-08 14:51:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:58,134 INFO L432 stractBuchiCegarLoop]: Abstraction has 1170 states and 1878 transitions. [2025-02-08 14:51:58,137 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-08 14:51:58,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1170 states and 1878 transitions. [2025-02-08 14:51:58,141 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:58,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,145 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:58,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,145 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:58,145 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:58,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1382420299, now seen corresponding path program 1 times [2025-02-08 14:51:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224571338] [2025-02-08 14:51:58,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:58,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:58,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,188 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,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224571338] [2025-02-08 14:51:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224571338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825416936] [2025-02-08 14:51:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,189 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 7 times [2025-02-08 14:51:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449479393] [2025-02-08 14:51:58,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:51:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:58,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:58,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:58,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:58,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:58,214 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:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,257 INFO L93 Difference]: Finished difference Result 2202 states and 3509 transitions. [2025-02-08 14:51:58,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2202 states and 3509 transitions. [2025-02-08 14:51:58,265 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:58,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2202 states to 2202 states and 3509 transitions. [2025-02-08 14:51:58,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2202 [2025-02-08 14:51:58,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2202 [2025-02-08 14:51:58,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2202 states and 3509 transitions. [2025-02-08 14:51:58,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2202 states and 3509 transitions. [2025-02-08 14:51:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states and 3509 transitions. [2025-02-08 14:51:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1775. [2025-02-08 14:51:58,292 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:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2936 transitions. [2025-02-08 14:51:58,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1775 states and 2936 transitions. [2025-02-08 14:51:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:58,296 INFO L432 stractBuchiCegarLoop]: Abstraction has 1775 states and 2936 transitions. [2025-02-08 14:51:58,296 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-08 14:51:58,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1775 states and 2936 transitions. [2025-02-08 14:51:58,301 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:58,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,301 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:58,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,301 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:58,302 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:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2068075126, now seen corresponding path program 1 times [2025-02-08 14:51:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193091024] [2025-02-08 14:51:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:58,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:58,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,327 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,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193091024] [2025-02-08 14:51:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193091024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048932195] [2025-02-08 14:51:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,328 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 8 times [2025-02-08 14:51:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748504096] [2025-02-08 14:51:58,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:58,330 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:58,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:51:58,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:51:58,352 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:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,378 INFO L93 Difference]: Finished difference Result 1619 states and 2441 transitions. [2025-02-08 14:51:58,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2441 transitions. [2025-02-08 14:51:58,382 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 646 [2025-02-08 14:51:58,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1619 states and 2441 transitions. [2025-02-08 14:51:58,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1619 [2025-02-08 14:51:58,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1619 [2025-02-08 14:51:58,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1619 states and 2441 transitions. [2025-02-08 14:51:58,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1619 states and 2441 transitions. [2025-02-08 14:51:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states and 2441 transitions. [2025-02-08 14:51:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1268. [2025-02-08 14:51:58,401 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:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1978 transitions. [2025-02-08 14:51:58,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1268 states and 1978 transitions. [2025-02-08 14:51:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:51:58,404 INFO L432 stractBuchiCegarLoop]: Abstraction has 1268 states and 1978 transitions. [2025-02-08 14:51:58,405 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-08 14:51:58,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1268 states and 1978 transitions. [2025-02-08 14:51:58,407 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:58,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,407 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:58,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,408 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:58,408 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:58,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1382450090, now seen corresponding path program 1 times [2025-02-08 14:51:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757504905] [2025-02-08 14:51:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,438 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,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757504905] [2025-02-08 14:51:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757504905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337617175] [2025-02-08 14:51:58,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,439 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash -77701486, now seen corresponding path program 9 times [2025-02-08 14:51:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304273825] [2025-02-08 14:51:58,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:58,441 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:58,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:58,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:58,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:58,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,462 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:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,501 INFO L93 Difference]: Finished difference Result 2330 states and 3539 transitions. [2025-02-08 14:51:58,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2330 states and 3539 transitions. [2025-02-08 14:51:58,506 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 809 [2025-02-08 14:51:58,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2330 states to 2330 states and 3539 transitions. [2025-02-08 14:51:58,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2330 [2025-02-08 14:51:58,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2330 [2025-02-08 14:51:58,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2330 states and 3539 transitions. [2025-02-08 14:51:58,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2330 states and 3539 transitions. [2025-02-08 14:51:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states and 3539 transitions. [2025-02-08 14:51:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 1268. [2025-02-08 14:51:58,530 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:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1947 transitions. [2025-02-08 14:51:58,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1268 states and 1947 transitions. [2025-02-08 14:51:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:58,533 INFO L432 stractBuchiCegarLoop]: Abstraction has 1268 states and 1947 transitions. [2025-02-08 14:51:58,533 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-08 14:51:58,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1268 states and 1947 transitions. [2025-02-08 14:51:58,536 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 323 [2025-02-08 14:51:58,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,536 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:58,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,536 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:58,536 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:58,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1631657648, now seen corresponding path program 1 times [2025-02-08 14:51:58,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955457270] [2025-02-08 14:51:58,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:51:58,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:51:58,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,555 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,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955457270] [2025-02-08 14:51:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955457270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861303844] [2025-02-08 14:51:58,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,556 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -635268902, now seen corresponding path program 1 times [2025-02-08 14:51:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67734836] [2025-02-08 14:51:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:58,558 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,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:58,559 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,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:58,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:58,587 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:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,589 INFO L93 Difference]: Finished difference Result 332 states and 449 transitions. [2025-02-08 14:51:58,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 449 transitions. [2025-02-08 14:51:58,590 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 163 [2025-02-08 14:51:58,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 449 transitions. [2025-02-08 14:51:58,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2025-02-08 14:51:58,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2025-02-08 14:51:58,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 449 transitions. [2025-02-08 14:51:58,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 449 transitions. [2025-02-08 14:51:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 449 transitions. [2025-02-08 14:51:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-08 14:51:58,595 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:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2025-02-08 14:51:58,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 449 transitions. [2025-02-08 14:51:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:58,596 INFO L432 stractBuchiCegarLoop]: Abstraction has 332 states and 449 transitions. [2025-02-08 14:51:58,596 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-08 14:51:58,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 449 transitions. [2025-02-08 14:51:58,597 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 163 [2025-02-08 14:51:58,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,597 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:58,597 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,598 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:58,598 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:58,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash -93719475, now seen corresponding path program 1 times [2025-02-08 14:51:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849287683] [2025-02-08 14:51:58,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:51:58,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:51:58,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,628 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,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849287683] [2025-02-08 14:51:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849287683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554407985] [2025-02-08 14:51:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,629 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1820356983, now seen corresponding path program 2 times [2025-02-08 14:51:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403308004] [2025-02-08 14:51:58,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:58,632 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:58,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:58,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:58,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,654 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:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,713 INFO L93 Difference]: Finished difference Result 438 states and 572 transitions. [2025-02-08 14:51:58,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 572 transitions. [2025-02-08 14:51:58,714 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 237 [2025-02-08 14:51:58,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 438 states and 572 transitions. [2025-02-08 14:51:58,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2025-02-08 14:51:58,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2025-02-08 14:51:58,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 572 transitions. [2025-02-08 14:51:58,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 438 states and 572 transitions. [2025-02-08 14:51:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 572 transitions. [2025-02-08 14:51:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 248. [2025-02-08 14:51:58,719 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:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 338 transitions. [2025-02-08 14:51:58,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 248 states and 338 transitions. [2025-02-08 14:51:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:58,720 INFO L432 stractBuchiCegarLoop]: Abstraction has 248 states and 338 transitions. [2025-02-08 14:51:58,721 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-08 14:51:58,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 338 transitions. [2025-02-08 14:51:58,721 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 79 [2025-02-08 14:51:58,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,722 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:58,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,722 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:58,722 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:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1389664264, now seen corresponding path program 1 times [2025-02-08 14:51:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677910882] [2025-02-08 14:51:58,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:51:58,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:51:58,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,753 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,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677910882] [2025-02-08 14:51:58,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677910882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811575180] [2025-02-08 14:51:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,754 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash -8102544, now seen corresponding path program 2 times [2025-02-08 14:51:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450737913] [2025-02-08 14:51:58,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:58,757 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:58,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:51:58,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:51:58,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,779 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:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,806 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2025-02-08 14:51:58,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 407 transitions. [2025-02-08 14:51:58,807 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 105 [2025-02-08 14:51:58,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 306 states and 407 transitions. [2025-02-08 14:51:58,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2025-02-08 14:51:58,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2025-02-08 14:51:58,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2025-02-08 14:51:58,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 306 states and 407 transitions. [2025-02-08 14:51:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2025-02-08 14:51:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 204. [2025-02-08 14:51:58,811 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:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2025-02-08 14:51:58,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-02-08 14:51:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:58,812 INFO L432 stractBuchiCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-02-08 14:51:58,812 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-08 14:51:58,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 283 transitions. [2025-02-08 14:51:58,812 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-02-08 14:51:58,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,813 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:58,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,813 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:58,813 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:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 129919915, now seen corresponding path program 1 times [2025-02-08 14:51:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4529016] [2025-02-08 14:51:58,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 14:51:58,819 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,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,851 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,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4529016] [2025-02-08 14:51:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4529016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143275639] [2025-02-08 14:51:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,851 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:58,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 337210215, now seen corresponding path program 2 times [2025-02-08 14:51:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790970328] [2025-02-08 14:51:58,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:58,853 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,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:51:58,854 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,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,877 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,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:58,903 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2025-02-08 14:51:58,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 326 transitions. [2025-02-08 14:51:58,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-08 14:51:58,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 237 states and 326 transitions. [2025-02-08 14:51:58,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-02-08 14:51:58,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2025-02-08 14:51:58,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 326 transitions. [2025-02-08 14:51:58,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:58,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 237 states and 326 transitions. [2025-02-08 14:51:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 326 transitions. [2025-02-08 14:51:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 176. [2025-02-08 14:51:58,906 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,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 251 transitions. [2025-02-08 14:51:58,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 251 transitions. [2025-02-08 14:51:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:58,907 INFO L432 stractBuchiCegarLoop]: Abstraction has 176 states and 251 transitions. [2025-02-08 14:51:58,907 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-08 14:51:58,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 251 transitions. [2025-02-08 14:51:58,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:51:58,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:58,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:58,908 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,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:58,908 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,909 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,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 877415212, now seen corresponding path program 1 times [2025-02-08 14:51:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056897209] [2025-02-08 14:51:58,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:58,915 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,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:51:58,918 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,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash 914158350, now seen corresponding path program 2 times [2025-02-08 14:51:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640198235] [2025-02-08 14:51:58,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:58,926 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,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:58,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:58,927 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,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:58,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -877472327, now seen corresponding path program 1 times [2025-02-08 14:51:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:58,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32689165] [2025-02-08 14:51:58,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:58,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 14:51:58,933 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,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:58,959 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,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32689165] [2025-02-08 14:51:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32689165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:51:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733367714] [2025-02-08 14:51:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:51:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:51:58,980 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:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:59,000 INFO L93 Difference]: Finished difference Result 204 states and 290 transitions. [2025-02-08 14:51:59,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 290 transitions. [2025-02-08 14:51:59,001 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:51:59,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 0 states and 0 transitions. [2025-02-08 14:51:59,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:51:59,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:51:59,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:51:59,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:59,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:51:59,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:51:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:59,002 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:51:59,002 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-08 14:51:59,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:51:59,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:51:59,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:51:59,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:51:59 BoogieIcfgContainer [2025-02-08 14:51:59,008 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:51:59,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:51:59,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:51:59,008 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:51:59,009 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:55" (3/4) ... [2025-02-08 14:51:59,010 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:51:59,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:51:59,011 INFO L158 Benchmark]: Toolchain (without parser) took 4510.92ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 110.5MB in the beginning and 230.5MB in the end (delta: -120.0MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2025-02-08 14:51:59,011 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:59,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.62ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 94.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:51:59,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:51:59,012 INFO L158 Benchmark]: Boogie Preprocessor took 35.31ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:59,012 INFO L158 Benchmark]: IcfgBuilder took 957.65ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 92.2MB in the end (delta: -5.1MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2025-02-08 14:51:59,012 INFO L158 Benchmark]: BuchiAutomizer took 3212.66ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 92.2MB in the beginning and 230.6MB in the end (delta: -138.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-02-08 14:51:59,012 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 343.9MB. Free memory was 230.6MB in the beginning and 230.5MB in the end (delta: 65.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:51:59,013 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.62ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 94.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.31ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 957.65ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 92.2MB in the end (delta: -5.1MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 3212.66ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 92.2MB in the beginning and 230.6MB in the end (delta: -138.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 343.9MB. Free memory was 230.6MB in the beginning and 230.5MB in the end (delta: 65.9kB). Peak memory consumption was 8.4MB. 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 3.1s and 24 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. 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.1s 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4241 mSDsluCounter, 5143 SdHoareTripleChecker+Invalid, 0.3s 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:59,025 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