./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/zonotope_3.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_3.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a7308dc5f86f1f4eda090a45a8f84359680ddfad7d17e2c5273bd494b2cbe5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:51:27,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:51:27,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:51:27,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:51:27,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:51:27,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:51:27,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:51:27,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:51:27,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:51:27,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:51:27,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:51:27,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:51:27,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:51:27,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:51:27,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:51:27,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:51:27,793 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a7308dc5f86f1f4eda090a45a8f84359680ddfad7d17e2c5273bd494b2cbe5e [2025-03-08 02:51:27,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:51:28,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:51:28,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:51:28,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:51:28,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:51:28,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_3.c.v+lhb-reducer.c [2025-03-08 02:51:29,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6539d459d/8d2ee742983e4ed3817e25e564710877/FLAGaff1ee3db [2025-03-08 02:51:29,368 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:51:29,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c.v+lhb-reducer.c [2025-03-08 02:51:29,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6539d459d/8d2ee742983e4ed3817e25e564710877/FLAGaff1ee3db [2025-03-08 02:51:29,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6539d459d/8d2ee742983e4ed3817e25e564710877 [2025-03-08 02:51:29,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:51:29,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:51:29,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:51:29,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:51:29,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:51:29,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a094e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29, skipping insertion in model container [2025-03-08 02:51:29,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:51:29,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c.v+lhb-reducer.c[12131,12144] [2025-03-08 02:51:29,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:51:29,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:51:29,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c.v+lhb-reducer.c[12131,12144] [2025-03-08 02:51:29,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:51:29,669 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:51:29,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29 WrapperNode [2025-03-08 02:51:29,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:51:29,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:51:29,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:51:29,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:51:29,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,714 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 613 [2025-03-08 02:51:29,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:51:29,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:51:29,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:51:29,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:51:29,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,750 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-03-08 02:51:29,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:51:29,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:51:29,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:51:29,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:51:29,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (1/1) ... [2025-03-08 02:51:29,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:51:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:51:29,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:51:29,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:51:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:51:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:51:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:51:29,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:51:29,917 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:51:29,919 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:51:30,207 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L516: havoc main_~__tmp_44~0#1, main_~g__x~21#1;havoc main_~__tmp_43~0#1, main_~f__x~21#1, main_~main____CPAchecker_TMP_1~9#1;havoc main_~__tmp_42~0#1, main_~g__x~20#1;havoc main_~__tmp_41~0#1, main_~f__x~20#1;havoc main_~main____CPAchecker_TMP_0~9#1; [2025-03-08 02:51:30,207 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~__tmp_40~0#1, main_~g__x~19#1;havoc main_~__tmp_39~0#1, main_~f__x~19#1, main_~main____CPAchecker_TMP_1~8#1;havoc main_~__tmp_38~0#1, main_~g__x~18#1;havoc main_~__tmp_37~0#1, main_~f__x~18#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_36~0#1, main_~g__x~17#1;havoc main_~__tmp_35~0#1, main_~f__x~17#1, main_~main____CPAchecker_TMP_1~7#1;havoc main_~__tmp_34~0#1, main_~g__x~16#1;havoc main_~__tmp_33~0#1, main_~f__x~16#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_32~0#1, main_~g__x~15#1;havoc main_~__tmp_31~0#1, main_~f__x~15#1, main_~main____CPAchecker_TMP_1~6#1;havoc main_~__tmp_30~0#1, main_~g__x~14#1;havoc main_~__tmp_29~0#1, main_~f__x~14#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_28~0#1, main_~g__x~13#1;havoc main_~__tmp_27~0#1, main_~f__x~13#1, main_~main____CPAchecker_TMP_1~5#1;havoc main_~__tmp_26~0#1, main_~g__x~12#1;havoc main_~__tmp_25~0#1, main_~f__x~12#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_24~0#1, main_~g__x~11#1;havoc main_~__tmp_23~0#1, main_~f__x~11#1, main_~main____CPAchecker_TMP_1~4#1;havoc main_~__tmp_22~0#1, main_~g__x~10#1;havoc main_~__tmp_21~0#1, main_~f__x~10#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_20~0#1, main_~g__x~9#1;havoc main_~__tmp_19~0#1, main_~f__x~9#1, main_~main____CPAchecker_TMP_1~3#1;havoc main_~__tmp_18~0#1, main_~g__x~8#1;havoc main_~__tmp_17~0#1, main_~f__x~8#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_16~0#1, main_~g__x~7#1;havoc main_~__tmp_15~0#1, main_~f__x~7#1, main_~main____CPAchecker_TMP_1~2#1;havoc main_~__tmp_14~0#1, main_~g__x~6#1;havoc main_~__tmp_13~0#1, main_~f__x~6#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_12~0#1, main_~g__x~5#1;havoc main_~__tmp_11~0#1, main_~f__x~5#1, main_~main____CPAchecker_TMP_1~1#1;havoc main_~__tmp_10~0#1, main_~g__x~4#1;havoc main_~__tmp_9~0#1, main_~f__x~4#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_8~0#1, main_~g__x~3#1;havoc main_~__tmp_7~0#1, main_~f__x~3#1, main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_6~0#1, main_~g__x~2#1;havoc main_~__tmp_5~0#1, main_~f__x~2#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_4~0#1, main_~g__x~1#1;havoc main_~__tmp_3~0#1, main_~f__x~1#1;havoc main_~__tmp_2~0#1, main_~g__x~0#1;havoc main_~__tmp_1~0#1, main_~f__x~0#1; [2025-03-08 02:51:30,207 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: havoc main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2025-03-08 02:51:30,224 INFO L? ?]: Removed 179 outVars from TransFormulas that were not future-live. [2025-03-08 02:51:30,224 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:51:30,230 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:51:30,230 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:51:30,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:51:30 BoogieIcfgContainer [2025-03-08 02:51:30,231 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:51:30,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:51:30,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:51:30,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:51:30,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:51:29" (1/3) ... [2025-03-08 02:51:30,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acb134d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:51:30, skipping insertion in model container [2025-03-08 02:51:30,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:51:29" (2/3) ... [2025-03-08 02:51:30,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acb134d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:51:30, skipping insertion in model container [2025-03-08 02:51:30,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:51:30" (3/3) ... [2025-03-08 02:51:30,238 INFO L128 eAbstractionObserver]: Analyzing ICFG zonotope_3.c.v+lhb-reducer.c [2025-03-08 02:51:30,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:51:30,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG zonotope_3.c.v+lhb-reducer.c that has 1 procedures, 54 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 02:51:30,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:51:30,301 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ee03687, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:51:30,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:51:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 53 states have internal predecessors, (96), 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-03-08 02:51:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 02:51:30,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:30,310 INFO L218 NwaCegarLoop]: trace 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-03-08 02:51:30,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:30,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1078788411, now seen corresponding path program 1 times [2025-03-08 02:51:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614430579] [2025-03-08 02:51:30,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:51:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:30,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 02:51:30,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 02:51:30,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:51:30,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:30,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:30,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614430579] [2025-03-08 02:51:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614430579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:51:30,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:51:30,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:51:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904272459] [2025-03-08 02:51:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:51:30,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:51:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:30,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:51:30,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:51:30,715 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 53 states have internal predecessors, (96), 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 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-03-08 02:51:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:30,759 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2025-03-08 02:51:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:51:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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) Word has length 45 [2025-03-08 02:51:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:30,769 INFO L225 Difference]: With dead ends: 61 [2025-03-08 02:51:30,769 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 02:51:30,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:51:30,773 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:30,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:51:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 02:51:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 02:51:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 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-03-08 02:51:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2025-03-08 02:51:30,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2025-03-08 02:51:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2025-03-08 02:51:30,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-03-08 02:51:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2025-03-08 02:51:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 02:51:30,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:30,797 INFO L218 NwaCegarLoop]: trace 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-03-08 02:51:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:51:30,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:30,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1079771514, now seen corresponding path program 1 times [2025-03-08 02:51:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653467723] [2025-03-08 02:51:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:51:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:30,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 02:51:30,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 02:51:30,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:51:30,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653467723] [2025-03-08 02:51:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653467723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:51:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:51:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 02:51:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596391801] [2025-03-08 02:51:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:51:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 02:51:31,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:31,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 02:51:31,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 02:51:31,090 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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-03-08 02:51:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:31,154 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-03-08 02:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 02:51:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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) Word has length 45 [2025-03-08 02:51:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:31,155 INFO L225 Difference]: With dead ends: 64 [2025-03-08 02:51:31,155 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 02:51:31,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 02:51:31,156 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:31,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 134 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 02:51:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 02:51:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-08 02:51:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 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-03-08 02:51:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2025-03-08 02:51:31,161 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 45 [2025-03-08 02:51:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:31,161 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2025-03-08 02:51:31,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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-03-08 02:51:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2025-03-08 02:51:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 02:51:31,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:31,163 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:51:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:51:31,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:31,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1299167314, now seen corresponding path program 1 times [2025-03-08 02:51:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144353832] [2025-03-08 02:51:31,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:51:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:31,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 02:51:31,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 02:51:31,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:51:31,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144353832] [2025-03-08 02:51:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144353832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:51:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:51:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:51:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098991890] [2025-03-08 02:51:31,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:51:31,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:51:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:31,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:51:31,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:51:31,238 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03-08 02:51:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:31,246 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-08 02:51:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:51:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2025-03-08 02:51:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:31,248 INFO L225 Difference]: With dead ends: 67 [2025-03-08 02:51:31,249 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 02:51:31,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:51:31,249 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:31,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:51:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 02:51:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 02:51:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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-03-08 02:51:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2025-03-08 02:51:31,252 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2025-03-08 02:51:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:31,252 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-03-08 02:51:31,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03-08 02:51:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2025-03-08 02:51:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 02:51:31,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:31,253 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:51:31,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:51:31,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:31,254 INFO L85 PathProgramCache]: Analyzing trace with hash 815622449, now seen corresponding path program 1 times [2025-03-08 02:51:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:31,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694352167] [2025-03-08 02:51:31,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:51:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 02:51:31,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 02:51:31,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:51:31,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694352167] [2025-03-08 02:51:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694352167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:51:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822050727] [2025-03-08 02:51:31,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:51:31,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:31,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:51:31,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:51:31,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:51:31,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 02:51:31,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 02:51:31,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:51:31,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:31,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 02:51:31,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:51:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:31,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:51:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822050727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:51:32,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:51:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 02:51:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062793732] [2025-03-08 02:51:32,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:51:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 02:51:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:32,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 02:51:32,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 02:51:32,041 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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-03-08 02:51:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:32,125 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2025-03-08 02:51:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 02:51:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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) Word has length 50 [2025-03-08 02:51:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:32,126 INFO L225 Difference]: With dead ends: 119 [2025-03-08 02:51:32,126 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 02:51:32,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 02:51:32,127 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 100 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:32,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 02:51:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 02:51:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 02:51:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.018018018018018) internal successors, (113), 111 states have internal predecessors, (113), 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-03-08 02:51:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2025-03-08 02:51:32,132 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 50 [2025-03-08 02:51:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:32,132 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2025-03-08 02:51:32,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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-03-08 02:51:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2025-03-08 02:51:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 02:51:32,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:32,133 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 02:51:32,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:51:32,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:32,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash -864027919, now seen corresponding path program 2 times [2025-03-08 02:51:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:32,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080660646] [2025-03-08 02:51:32,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 02:51:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:32,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-03-08 02:51:32,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 02:51:32,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 02:51:32,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:32,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080660646] [2025-03-08 02:51:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080660646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:51:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196498183] [2025-03-08 02:51:32,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 02:51:32,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:51:32,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:51:32,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:51:33,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-03-08 02:51:33,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 02:51:33,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 02:51:33,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:33,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 02:51:33,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:51:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:33,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:51:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:34,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196498183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:51:34,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:51:34,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-08 02:51:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942761328] [2025-03-08 02:51:34,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:51:34,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 02:51:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:34,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 02:51:34,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 02:51:34,117 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 49 states, 49 states have (on average 4.469387755102041) internal successors, (219), 49 states have internal predecessors, (219), 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-03-08 02:51:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:34,308 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2025-03-08 02:51:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 02:51:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.469387755102041) internal successors, (219), 49 states have internal predecessors, (219), 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) Word has length 110 [2025-03-08 02:51:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:34,310 INFO L225 Difference]: With dead ends: 239 [2025-03-08 02:51:34,312 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 02:51:34,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 02:51:34,314 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:34,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 257 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 02:51:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 02:51:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-08 02:51:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.0086580086580086) internal successors, (233), 231 states have internal predecessors, (233), 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-03-08 02:51:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2025-03-08 02:51:34,331 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 110 [2025-03-08 02:51:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:34,332 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2025-03-08 02:51:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.469387755102041) internal successors, (219), 49 states have internal predecessors, (219), 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-03-08 02:51:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2025-03-08 02:51:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 02:51:34,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:34,337 INFO L218 NwaCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 02:51:34,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 02:51:34,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:34,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:34,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2081930865, now seen corresponding path program 3 times [2025-03-08 02:51:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:34,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251454229] [2025-03-08 02:51:34,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 02:51:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:34,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 230 statements into 38 equivalence classes. [2025-03-08 02:51:34,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 02:51:34,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2025-03-08 02:51:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:36,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251454229] [2025-03-08 02:51:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251454229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:51:36,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787267098] [2025-03-08 02:51:36,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 02:51:36,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:36,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:51:36,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:51:36,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:51:36,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 230 statements into 38 equivalence classes. [2025-03-08 02:51:36,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 02:51:36,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2025-03-08 02:51:36,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:36,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 02:51:36,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:51:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:37,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:51:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787267098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:51:39,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:51:39,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-08 02:51:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894828581] [2025-03-08 02:51:39,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:51:39,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-08 02:51:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:39,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-08 02:51:39,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 02:51:39,138 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand has 97 states, 97 states have (on average 4.731958762886598) internal successors, (459), 97 states have internal predecessors, (459), 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-03-08 02:51:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:39,453 INFO L93 Difference]: Finished difference Result 479 states and 528 transitions. [2025-03-08 02:51:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-08 02:51:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 4.731958762886598) internal successors, (459), 97 states have internal predecessors, (459), 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) Word has length 230 [2025-03-08 02:51:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:39,456 INFO L225 Difference]: With dead ends: 479 [2025-03-08 02:51:39,457 INFO L226 Difference]: Without dead ends: 472 [2025-03-08 02:51:39,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 02:51:39,461 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:39,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 401 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 02:51:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-08 02:51:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-08 02:51:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.0042462845010616) internal successors, (473), 471 states have internal predecessors, (473), 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-03-08 02:51:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2025-03-08 02:51:39,478 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 230 [2025-03-08 02:51:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:39,478 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2025-03-08 02:51:39,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 4.731958762886598) internal successors, (459), 97 states have internal predecessors, (459), 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-03-08 02:51:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2025-03-08 02:51:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 02:51:39,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:39,484 INFO L218 NwaCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 02:51:39,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:51:39,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:39,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:39,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:39,688 INFO L85 PathProgramCache]: Analyzing trace with hash -19806863, now seen corresponding path program 4 times [2025-03-08 02:51:39,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:39,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044109135] [2025-03-08 02:51:39,688 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 02:51:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:39,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 470 statements into 2 equivalence classes. [2025-03-08 02:51:39,916 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 02:51:39,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 02:51:39,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:51:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044109135] [2025-03-08 02:51:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044109135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:51:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759527937] [2025-03-08 02:51:44,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 02:51:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:44,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:51:44,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:51:44,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:51:45,249 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 470 statements into 2 equivalence classes. [2025-03-08 02:51:45,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 02:51:45,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 02:51:45,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:45,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 3850 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-08 02:51:45,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:51:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:45,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:51:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759527937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:51:52,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:51:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 192 [2025-03-08 02:51:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317828303] [2025-03-08 02:51:52,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:51:53,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-08 02:51:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:51:53,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-08 02:51:53,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-08 02:51:53,011 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand has 192 states, 192 states have (on average 4.864583333333333) internal successors, (934), 192 states have internal predecessors, (934), 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-03-08 02:51:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:54,294 INFO L93 Difference]: Finished difference Result 959 states and 1056 transitions. [2025-03-08 02:51:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-08 02:51:54,295 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 192 states have (on average 4.864583333333333) internal successors, (934), 192 states have internal predecessors, (934), 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) Word has length 470 [2025-03-08 02:51:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:54,299 INFO L225 Difference]: With dead ends: 959 [2025-03-08 02:51:54,300 INFO L226 Difference]: Without dead ends: 952 [2025-03-08 02:51:54,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-08 02:51:54,307 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 79 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:54,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 641 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 02:51:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-08 02:51:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2025-03-08 02:51:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 1.0021030494216614) internal successors, (953), 951 states have internal predecessors, (953), 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-03-08 02:51:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 953 transitions. [2025-03-08 02:51:54,331 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 953 transitions. Word has length 470 [2025-03-08 02:51:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 953 transitions. [2025-03-08 02:51:54,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 4.864583333333333) internal successors, (934), 192 states have internal predecessors, (934), 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-03-08 02:51:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 953 transitions. [2025-03-08 02:51:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-03-08 02:51:54,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:54,347 INFO L218 NwaCegarLoop]: trace histogram [182, 181, 181, 181, 181, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 02:51:54,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:51:54,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:51:54,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1953485681, now seen corresponding path program 5 times [2025-03-08 02:51:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:51:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283212952] [2025-03-08 02:51:54,548 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 02:51:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:51:54,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 950 statements into 182 equivalence classes. [2025-03-08 02:51:55,093 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 182 check-sat command(s) and asserted 950 of 950 statements. [2025-03-08 02:51:55,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 182 check-sat command(s) [2025-03-08 02:51:55,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:52:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 81812 backedges. 0 proven. 81812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:52:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:52:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283212952] [2025-03-08 02:52:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283212952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:52:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164647629] [2025-03-08 02:52:16,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 02:52:16,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:52:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:52:16,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:52:16,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:52:17,159 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 950 statements into 182 equivalence classes. [2025-03-08 02:52:19,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 182 check-sat command(s) and asserted 950 of 950 statements. [2025-03-08 02:52:19,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 182 check-sat command(s) [2025-03-08 02:52:19,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:52:19,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 7690 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-08 02:52:19,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:52:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 81812 backedges. 0 proven. 81812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:52:19,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:52:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 81812 backedges. 0 proven. 81812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:52:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164647629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:52:48,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:52:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193] total 385 [2025-03-08 02:52:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068278433] [2025-03-08 02:52:48,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:52:48,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 385 states [2025-03-08 02:52:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:52:48,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 385 interpolants. [2025-03-08 02:52:48,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73920, Invalid=73920, Unknown=0, NotChecked=0, Total=147840 [2025-03-08 02:52:48,948 INFO L87 Difference]: Start difference. First operand 952 states and 953 transitions. Second operand has 385 states, 385 states have (on average 4.932467532467532) internal successors, (1899), 385 states have internal predecessors, (1899), 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-03-08 02:52:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:52:59,311 INFO L93 Difference]: Finished difference Result 1919 states and 2112 transitions. [2025-03-08 02:52:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-08 02:52:59,313 INFO L78 Accepts]: Start accepts. Automaton has has 385 states, 385 states have (on average 4.932467532467532) internal successors, (1899), 385 states have internal predecessors, (1899), 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) Word has length 950 [2025-03-08 02:52:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:52:59,321 INFO L225 Difference]: With dead ends: 1919 [2025-03-08 02:52:59,321 INFO L226 Difference]: Without dead ends: 1912 [2025-03-08 02:52:59,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2091 GetRequests, 1708 SyntacticMatches, 0 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=73920, Invalid=73920, Unknown=0, NotChecked=0, Total=147840 [2025-03-08 02:52:59,330 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 80 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:52:59,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1273 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:52:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-03-08 02:52:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1912. [2025-03-08 02:52:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 1.0010465724751438) internal successors, (1913), 1911 states have internal predecessors, (1913), 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-03-08 02:52:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 1913 transitions. [2025-03-08 02:52:59,361 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 1913 transitions. Word has length 950 [2025-03-08 02:52:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:52:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 1913 transitions. [2025-03-08 02:52:59,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 385 states, 385 states have (on average 4.932467532467532) internal successors, (1899), 385 states have internal predecessors, (1899), 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-03-08 02:52:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 1913 transitions. [2025-03-08 02:52:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1911 [2025-03-08 02:52:59,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:52:59,428 INFO L218 NwaCegarLoop]: trace histogram [374, 373, 373, 373, 373, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 02:52:59,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:52:59,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:52:59,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:52:59,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:52:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash 810807153, now seen corresponding path program 6 times [2025-03-08 02:52:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:52:59,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961742654] [2025-03-08 02:52:59,630 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 02:52:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:52:59,998 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1910 statements into 374 equivalence classes. [2025-03-08 02:53:00,800 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 374 check-sat command(s) and asserted 1910 of 1910 statements. [2025-03-08 02:53:00,801 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 374 check-sat command(s) [2025-03-08 02:53:00,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat