./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35b23af90f01e46e9f818578c532dc01a817e343291a24c8592db5f0da05a3c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:14:08,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:14:08,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:14:08,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:14:08,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:14:08,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:14:08,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:14:08,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:14:08,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:14:08,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:14:08,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:14:08,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:14:08,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:14:08,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:14:08,379 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:14:08,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:14:08,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:14:08,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:14:08,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:14:08,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:14:08,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:14:08,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:14:08,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:14:08,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:14:08,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:14:08,382 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> 35b23af90f01e46e9f818578c532dc01a817e343291a24c8592db5f0da05a3c7 [2025-02-07 21:14:08,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:14:08,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:14:08,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:14:08,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:14:08,700 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:14:08,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2025-02-07 21:14:10,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/715131144/cdc68c38a6774da0bc45aa3cfdf3520b/FLAG833998bf8 [2025-02-07 21:14:10,348 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:14:10,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2025-02-07 21:14:10,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/715131144/cdc68c38a6774da0bc45aa3cfdf3520b/FLAG833998bf8 [2025-02-07 21:14:10,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/715131144/cdc68c38a6774da0bc45aa3cfdf3520b [2025-02-07 21:14:10,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:14:10,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:14:10,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:14:10,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:14:10,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:14:10,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55619b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10, skipping insertion in model container [2025-02-07 21:14:10,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:14:10,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c[12042,12055] [2025-02-07 21:14:10,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:14:10,612 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:14:10,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c[12042,12055] [2025-02-07 21:14:10,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:14:10,703 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:14:10,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10 WrapperNode [2025-02-07 21:14:10,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:14:10,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:14:10,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:14:10,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:14:10,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,773 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 426 [2025-02-07 21:14:10,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:14:10,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:14:10,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:14:10,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:14:10,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,804 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:14:10,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:14:10,826 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:14:10,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:14:10,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:14:10,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (1/1) ... [2025-02-07 21:14:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:14:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:10,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:14:10,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:14:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:14:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-02-07 21:14:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-02-07 21:14:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:14:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:14:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-02-07 21:14:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-02-07 21:14:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-02-07 21:14:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-02-07 21:14:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-02-07 21:14:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-02-07 21:14:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:14:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:14:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:14:11,014 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:14:11,016 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: assume ~VALUE1~0 == ~VALUE3~0; [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: assume !(~VALUE1~0 == ~VALUE3~0); [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: assume 0 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: assume !(0 == gate2_each_pals_period_~next_state~1#1); [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume !(1 == check_~temp_count~0#1);check_#res#1 := 0; [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume !!(1 == check_~temp_count~0#1); [2025-02-07 21:14:11,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: assume !(0 != ~gate3Failed~0 % 256);havoc gate3_each_pals_period_#t~nondet36#1;assume -128 <= gate3_each_pals_period_#t~nondet36#1 && gate3_each_pals_period_#t~nondet36#1 <= 127;gate3_each_pals_period_~tmp~5#1 := gate3_each_pals_period_#t~nondet36#1;havoc gate3_each_pals_period_#t~nondet36#1;gate3_each_pals_period_~next_state~2#1 := gate3_each_pals_period_~tmp~5#1; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: check_~tmp___9~0#1 := (if 0 == check_#t~ret26#1 % 256 then 0 else 1);havoc check_#t~ret26#1; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308-1: SUMMARY for call check_#t~ret26#1 := read_history_bool(2, 1); srcloc: null [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333-1: check_#res#1 := 1; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: assume -128 <= check_#t~ret22#1 && check_#t~ret22#1 <= 127;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300-1: SUMMARY for call check_#t~ret22#1 := read_history_int8(3, 1); srcloc: null [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L457: assume ~VALUE2~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L457: assume !(~VALUE2~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: assume 0 == (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256;assume false; [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: assume !(0 == (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256); [2025-02-07 21:14:11,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: assume !(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: assume !!(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume 1 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(1 == gate3_each_pals_period_~next_state~2#1); [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L474: havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L474-1: assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: assume ~VALUE1~0 == ~VALUE2~0; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: assume !(~VALUE1~0 == ~VALUE2~0); [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: SUMMARY for call write_history_bool(1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1)); srcloc: null [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: assume 0 == check_~tmp___9~0#1 % 256;check_#res#1 := 0; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: assume !(0 == check_~tmp___9~0#1 % 256); [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: assume -128 <= check_#t~ret20#1 && check_#t~ret20#1 <= 127;check_~tmp___2~2#1 := check_#t~ret20#1;havoc check_#t~ret20#1; [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276-1: SUMMARY for call check_#t~ret20#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume !(~VALUE2~0 != ~nomsg~0); [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: assume check_~tmp___10~0#1 > -2; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: assume !(check_~tmp___10~0#1 > -2); [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L524: main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret56#1 && main_#t~ret56#1 <= 2147483647;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: assume -128 <= check_#t~ret16#1 && check_#t~ret16#1 <= 127;check_~tmp___0~2#1 := check_#t~ret16#1;havoc check_#t~ret16#1; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268-1: SUMMARY for call check_#t~ret16#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: ~g3v_new~0 := (if (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 <= 127 then (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 else (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 - 256); [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume -128 <= check_#t~ret30#1 && check_#t~ret30#1 <= 127;check_~tmp___14~0#1 := check_#t~ret30#1;havoc check_#t~ret30#1; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326-1: SUMMARY for call check_#t~ret30#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: assume 0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256;assume false; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516: havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume !(0 == ~gate2Failed~0 % 256); [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L442: assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; [2025-02-07 21:14:11,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L442: assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: assume !(0 != ~gate2Failed~0 % 256);havoc gate2_each_pals_period_#t~nondet34#1;assume -128 <= gate2_each_pals_period_#t~nondet34#1 && gate2_each_pals_period_#t~nondet34#1 <= 127;gate2_each_pals_period_~tmp~4#1 := gate2_each_pals_period_#t~nondet34#1;havoc gate2_each_pals_period_#t~nondet34#1;gate2_each_pals_period_~next_state~1#1 := gate2_each_pals_period_~tmp~4#1; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: assume ~VALUE3~0 == check_~tmp___2~2#1;check_#t~post21#1 := check_~temp_count~0#1;check_~temp_count~0#1 := 1 + check_#t~post21#1;havoc check_#t~post21#1; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: assume !(~VALUE3~0 == check_~tmp___2~2#1); [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: assume -128 <= check_#t~ret23#1 && check_#t~ret23#1 <= 127;check_~tmp___6~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L302-1: SUMMARY for call check_#t~ret23#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume ~VALUE1~0 == check_~tmp___0~2#1;check_#t~post17#1 := check_~temp_count~0#1;check_~temp_count~0#1 := 1 + check_#t~post17#1;havoc check_#t~post17#1; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume !(~VALUE1~0 == check_~tmp___0~2#1); [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L525-1: SUMMARY for call assert((if 0 == main_~c1~0#1 then 0 else 1)); srcloc: null [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: assume 0 == (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256;assume false; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: assume !(0 == (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256); [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume !(~VALUE3~0 == check_~tmp___14~0#1);check_#res#1 := 0; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume !!(~VALUE3~0 == check_~tmp___14~0#1); [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L294: assume !(check_~temp_count~0#1 > 1);check_#res#1 := 0; [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L294: assume !!(check_~temp_count~0#1 > 1); [2025-02-07 21:14:11,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261-1: SUMMARY for call check_#t~ret13#1 := read_history_bool(0, 1); srcloc: null [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume 1 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume !(1 == gate2_each_pals_period_~next_state~1#1); [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: assume check_~tmp___6~0#1 == ~nomsg~0; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: assume !(check_~tmp___6~0#1 == ~nomsg~0); [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: SUMMARY for call assert(0); srcloc: null [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: ~g2v_new~0 := (if (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 <= 127 then (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 else (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 - 256); [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: assume 0 == check_~tmp___3~0#1 % 256; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: assume !(0 == check_~tmp___3~0#1 % 256); [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume 2 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume !(2 == gate3_each_pals_period_~next_state~2#1);gate3_each_pals_period_~tmp___0~5#1 := 0; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: assume -128 <= check_#t~ret27#1 && check_#t~ret27#1 <= 127;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320-1: SUMMARY for call check_#t~ret27#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L469: assume ~VALUE3~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; [2025-02-07 21:14:11,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L469: assume !(~VALUE3~0 != ~nomsg~0); [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: check_~tmp___7~0#1 := (if 0 == check_#t~ret24#1 % 256 then 0 else 1);havoc check_#t~ret24#1; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304-1: SUMMARY for call check_#t~ret24#1 := read_history_bool(0, 1); srcloc: null [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: check_~tmp___4~0#1 := (if 0 == check_#t~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#1; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: SUMMARY for call check_#t~ret14#1 := read_history_bool(1, 1); srcloc: null [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: assume check_~tmp___11~0#1 != ~nomsg~0; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: assume !(check_~tmp___11~0#1 != ~nomsg~0); [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume ~VALUE1~0 != ~VALUE2~0; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume !(~VALUE1~0 != ~VALUE2~0); [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: assume 0 != check_~tmp___7~0#1 % 256; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: assume !(0 != check_~tmp___7~0#1 % 256);check_#res#1 := 0; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: assume -128 <= check_#t~ret18#1 && check_#t~ret18#1 <= 127;check_~tmp___1~2#1 := check_#t~ret18#1;havoc check_#t~ret18#1; [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272-1: SUMMARY for call check_#t~ret18#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: assume 0 == check_~tmp___4~0#1 % 256; [2025-02-07 21:14:11,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: assume !(0 == check_~tmp___4~0#1 % 256); [2025-02-07 21:14:11,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume 2 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume !(2 == gate2_each_pals_period_~next_state~1#1);gate2_each_pals_period_~tmp___0~4#1 := 0; [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume -128 <= check_#t~ret28#1 && check_#t~ret28#1 <= 127;check_~tmp___12~0#1 := check_#t~ret28#1;havoc check_#t~ret28#1; [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322-1: SUMMARY for call check_#t~ret28#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L413: assume 0 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L413: assume !(0 == gate3_each_pals_period_~next_state~2#1); [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: assume ~VALUE1~0 != ~VALUE3~0; [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: assume !(~VALUE1~0 != ~VALUE3~0); [2025-02-07 21:14:11,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: check_~tmp___8~0#1 := (if 0 == check_#t~ret25#1 % 256 then 0 else 1);havoc check_#t~ret25#1; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306-1: SUMMARY for call check_#t~ret25#1 := read_history_bool(1, 1); srcloc: null [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: assume ~VALUE2~0 == check_~tmp___1~2#1;check_#t~post19#1 := check_~temp_count~0#1;check_~temp_count~0#1 := 1 + check_#t~post19#1;havoc check_#t~post19#1; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: assume !(~VALUE2~0 == check_~tmp___1~2#1); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: assume !(~VALUE1~0 != ~nomsg~0); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: check_~tmp___5~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265-1: SUMMARY for call check_#t~ret15#1 := read_history_bool(2, 1); srcloc: null [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: assume ~VALUE2~0 == ~VALUE3~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: assume !(~VALUE2~0 == ~VALUE3~0); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: assume !(3 == write_history_int8_~history_id#1); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume !(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume !!(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: assume ~VALUE2~0 != ~VALUE3~0; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: assume !(~VALUE2~0 != ~VALUE3~0); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: assume !(0 == ~gate1Failed~0 % 256); [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: SUMMARY for call assert(0); srcloc: null [2025-02-07 21:14:11,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: SUMMARY for call write_history_bool(2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1)); srcloc: null [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: assume 0 != check_~tmp___8~0#1 % 256; [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: assume !(0 != check_~tmp___8~0#1 % 256);check_#res#1 := 0; [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: assume 0 == check_~tmp___5~0#1 % 256;check_~temp_count~0#1 := 0; [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: assume !(0 == check_~tmp___5~0#1 % 256); [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume -128 <= check_#t~ret29#1 && check_#t~ret29#1 <= 127;check_~tmp___13~0#1 := check_#t~ret29#1;havoc check_#t~ret29#1; [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324-1: SUMMARY for call check_#t~ret29#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1; [2025-02-07 21:14:11,544 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-02-07 21:14:11,544 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:14:11,557 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:14:11,557 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:14:11,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:14:11 BoogieIcfgContainer [2025-02-07 21:14:11,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:14:11,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:14:11,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:14:11,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:14:11,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:14:10" (1/3) ... [2025-02-07 21:14:11,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24325f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:14:11, skipping insertion in model container [2025-02-07 21:14:11,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:14:10" (2/3) ... [2025-02-07 21:14:11,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24325f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:14:11, skipping insertion in model container [2025-02-07 21:14:11,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:14:11" (3/3) ... [2025-02-07 21:14:11,569 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2025-02-07 21:14:11,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:14:11,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c that has 6 procedures, 83 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:14:11,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:14:11,640 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;@671572a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:14:11,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:14:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 62 states have (on average 1.596774193548387) internal successors, (99), 66 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 21:14:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 21:14:11,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash -796675300, now seen corresponding path program 1 times [2025-02-07 21:14:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825993828] [2025-02-07 21:14:11,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 21:14:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 21:14:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825993828] [2025-02-07 21:14:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825993828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137080452] [2025-02-07 21:14:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:12,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:12,017 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.596774193548387) internal successors, (99), 66 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:14:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,087 INFO L93 Difference]: Finished difference Result 170 states and 263 transitions. [2025-02-07 21:14:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 21:14:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,097 INFO L225 Difference]: With dead ends: 170 [2025-02-07 21:14:12,097 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 21:14:12,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,103 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 21:14:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-07 21:14:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 21:14:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2025-02-07 21:14:12,146 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 14 [2025-02-07 21:14:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,147 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-02-07 21:14:12,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:14:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2025-02-07 21:14:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 21:14:12,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:14:12,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1854912387, now seen corresponding path program 1 times [2025-02-07 21:14:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994340266] [2025-02-07 21:14:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 21:14:12,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 21:14:12,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994340266] [2025-02-07 21:14:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994340266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:12,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074397088] [2025-02-07 21:14:12,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:12,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:12,259 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:14:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,306 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2025-02-07 21:14:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 21:14:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,310 INFO L225 Difference]: With dead ends: 166 [2025-02-07 21:14:12,310 INFO L226 Difference]: Without dead ends: 91 [2025-02-07 21:14:12,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,312 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 284 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-07 21:14:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-02-07 21:14:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.391304347826087) internal successors, (96), 70 states have internal predecessors, (96), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 21:14:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2025-02-07 21:14:12,334 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 15 [2025-02-07 21:14:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,334 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2025-02-07 21:14:12,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:14:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2025-02-07 21:14:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 21:14:12,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,335 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] [2025-02-07 21:14:12,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:14:12,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1397263366, now seen corresponding path program 1 times [2025-02-07 21:14:12,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33761411] [2025-02-07 21:14:12,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 21:14:12,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 21:14:12,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33761411] [2025-02-07 21:14:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33761411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192940067] [2025-02-07 21:14:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:12,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,471 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 21:14:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,506 INFO L93 Difference]: Finished difference Result 198 states and 278 transitions. [2025-02-07 21:14:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:12,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-07 21:14:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,511 INFO L225 Difference]: With dead ends: 198 [2025-02-07 21:14:12,511 INFO L226 Difference]: Without dead ends: 118 [2025-02-07 21:14:12,511 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-02-07 21:14:12,512 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 22 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 196 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-07 21:14:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2025-02-07 21:14:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.380281690140845) internal successors, (98), 72 states have internal predecessors, (98), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 21:14:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2025-02-07 21:14:12,531 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 22 [2025-02-07 21:14:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2025-02-07 21:14:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 21:14:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2025-02-07 21:14:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 21:14:12,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:14:12,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash 608857609, now seen corresponding path program 1 times [2025-02-07 21:14:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333642402] [2025-02-07 21:14:12,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 21:14:12,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 21:14:12,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333642402] [2025-02-07 21:14:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333642402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031949209] [2025-02-07 21:14:12,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:12,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,703 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 21:14:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,746 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2025-02-07 21:14:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-07 21:14:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,748 INFO L225 Difference]: With dead ends: 174 [2025-02-07 21:14:12,748 INFO L226 Difference]: Without dead ends: 93 [2025-02-07 21:14:12,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 21:14:12,753 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-07 21:14:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-02-07 21:14:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 72 states have internal predecessors, (97), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 21:14:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2025-02-07 21:14:12,762 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 31 [2025-02-07 21:14:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,762 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2025-02-07 21:14:12,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 21:14:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2025-02-07 21:14:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:14:12,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:14:12,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1348608983, now seen corresponding path program 1 times [2025-02-07 21:14:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240100179] [2025-02-07 21:14:12,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:14:12,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:14:12,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240100179] [2025-02-07 21:14:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240100179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126878198] [2025-02-07 21:14:12,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:14:12,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:12,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:14:12,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:14:12,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:14:12,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:14:12,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:14:12,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:14:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:14:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126878198] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:14:13,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:14:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:14:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756740179] [2025-02-07 21:14:13,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,076 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:14:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,139 INFO L93 Difference]: Finished difference Result 231 states and 330 transitions. [2025-02-07 21:14:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2025-02-07 21:14:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,141 INFO L225 Difference]: With dead ends: 231 [2025-02-07 21:14:13,143 INFO L226 Difference]: Without dead ends: 150 [2025-02-07 21:14:13,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,144 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 308 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-07 21:14:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2025-02-07 21:14:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.368421052631579) internal successors, (156), 115 states have internal predecessors, (156), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 21:14:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2025-02-07 21:14:13,162 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 33 [2025-02-07 21:14:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,163 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2025-02-07 21:14:13,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:14:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2025-02-07 21:14:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 21:14:13,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,167 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:13,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:14:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:14:13,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 811691017, now seen corresponding path program 2 times [2025-02-07 21:14:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100526022] [2025-02-07 21:14:13,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:14:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-07 21:14:13,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 55 statements. [2025-02-07 21:14:13,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:14:13,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-07 21:14:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100526022] [2025-02-07 21:14:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100526022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050782986] [2025-02-07 21:14:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,451 INFO L87 Difference]: Start difference. First operand 144 states and 200 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 21:14:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,484 INFO L93 Difference]: Finished difference Result 268 states and 384 transitions. [2025-02-07 21:14:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-02-07 21:14:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,486 INFO L225 Difference]: With dead ends: 268 [2025-02-07 21:14:13,486 INFO L226 Difference]: Without dead ends: 151 [2025-02-07 21:14:13,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:13,487 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 280 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-07 21:14:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-07 21:14:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 121 states have internal predecessors, (164), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 21:14:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 208 transitions. [2025-02-07 21:14:13,499 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 208 transitions. Word has length 55 [2025-02-07 21:14:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,499 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 208 transitions. [2025-02-07 21:14:13,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 21:14:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 208 transitions. [2025-02-07 21:14:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 21:14:13,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,501 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:13,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:14:13,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1916238893, now seen corresponding path program 1 times [2025-02-07 21:14:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011499315] [2025-02-07 21:14:13,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 21:14:13,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 21:14:13,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-07 21:14:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011499315] [2025-02-07 21:14:13,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011499315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916068925] [2025-02-07 21:14:13,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,593 INFO L87 Difference]: Start difference. First operand 151 states and 208 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 21:14:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,638 INFO L93 Difference]: Finished difference Result 312 states and 442 transitions. [2025-02-07 21:14:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-02-07 21:14:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,640 INFO L225 Difference]: With dead ends: 312 [2025-02-07 21:14:13,640 INFO L226 Difference]: Without dead ends: 188 [2025-02-07 21:14:13,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:13,642 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 22 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 283 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-07 21:14:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-02-07 21:14:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 152 states have internal predecessors, (200), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 21:14:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 250 transitions. [2025-02-07 21:14:13,655 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 250 transitions. Word has length 55 [2025-02-07 21:14:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 250 transitions. [2025-02-07 21:14:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 21:14:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 250 transitions. [2025-02-07 21:14:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 21:14:13,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,658 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:14:13,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1820264425, now seen corresponding path program 1 times [2025-02-07 21:14:13,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006120950] [2025-02-07 21:14:13,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 21:14:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 21:14:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-07 21:14:13,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006120950] [2025-02-07 21:14:13,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006120950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740493247] [2025-02-07 21:14:13,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:13,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:13,787 INFO L87 Difference]: Start difference. First operand 186 states and 250 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:14:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,821 INFO L93 Difference]: Finished difference Result 324 states and 442 transitions. [2025-02-07 21:14:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2025-02-07 21:14:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,823 INFO L225 Difference]: With dead ends: 324 [2025-02-07 21:14:13,823 INFO L226 Difference]: Without dead ends: 188 [2025-02-07 21:14:13,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 21:14:13,824 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-07 21:14:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-02-07 21:14:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.304635761589404) internal successors, (197), 152 states have internal predecessors, (197), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 21:14:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2025-02-07 21:14:13,836 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 73 [2025-02-07 21:14:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,836 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2025-02-07 21:14:13,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:14:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2025-02-07 21:14:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-07 21:14:13,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,839 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:13,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:14:13,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1464037481, now seen corresponding path program 1 times [2025-02-07 21:14:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564728096] [2025-02-07 21:14:13,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-07 21:14:13,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-07 21:14:13,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-07 21:14:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564728096] [2025-02-07 21:14:13,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564728096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837643167] [2025-02-07 21:14:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,968 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:14:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,028 INFO L93 Difference]: Finished difference Result 359 states and 496 transitions. [2025-02-07 21:14:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 101 [2025-02-07 21:14:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,031 INFO L225 Difference]: With dead ends: 359 [2025-02-07 21:14:14,031 INFO L226 Difference]: Without dead ends: 228 [2025-02-07 21:14:14,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,033 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 23 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 283 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-07 21:14:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-02-07 21:14:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 187 states have (on average 1.2727272727272727) internal successors, (238), 188 states have internal predecessors, (238), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-07 21:14:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2025-02-07 21:14:14,051 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 101 [2025-02-07 21:14:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,051 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2025-02-07 21:14:14,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:14:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2025-02-07 21:14:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-07 21:14:14,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,054 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:14:14,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash -359699232, now seen corresponding path program 1 times [2025-02-07 21:14:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640260440] [2025-02-07 21:14:14,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-07 21:14:14,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-07 21:14:14,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-02-07 21:14:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640260440] [2025-02-07 21:14:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640260440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314043506] [2025-02-07 21:14:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:14,160 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:14:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,204 INFO L93 Difference]: Finished difference Result 385 states and 514 transitions. [2025-02-07 21:14:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:14,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-02-07 21:14:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,206 INFO L225 Difference]: With dead ends: 385 [2025-02-07 21:14:14,206 INFO L226 Difference]: Without dead ends: 220 [2025-02-07 21:14:14,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,209 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 9 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 263 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-07 21:14:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-07 21:14:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 183 states have internal predecessors, (226), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-07 21:14:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2025-02-07 21:14:14,224 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 102 [2025-02-07 21:14:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,224 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2025-02-07 21:14:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:14:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2025-02-07 21:14:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-07 21:14:14,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,226 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:14:14,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash 180312445, now seen corresponding path program 1 times [2025-02-07 21:14:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141240519] [2025-02-07 21:14:14,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 21:14:14,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 21:14:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-02-07 21:14:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141240519] [2025-02-07 21:14:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141240519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285198118] [2025-02-07 21:14:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:14,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,360 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:14:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,395 INFO L93 Difference]: Finished difference Result 361 states and 466 transitions. [2025-02-07 21:14:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 121 [2025-02-07 21:14:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,397 INFO L225 Difference]: With dead ends: 361 [2025-02-07 21:14:14,397 INFO L226 Difference]: Without dead ends: 222 [2025-02-07 21:14:14,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 21:14:14,398 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-07 21:14:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2025-02-07 21:14:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.2252747252747254) internal successors, (223), 183 states have internal predecessors, (223), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-07 21:14:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 277 transitions. [2025-02-07 21:14:14,416 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 277 transitions. Word has length 121 [2025-02-07 21:14:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 277 transitions. [2025-02-07 21:14:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:14:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 277 transitions. [2025-02-07 21:14:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-07 21:14:14,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,420 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:14:14,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2028928253, now seen corresponding path program 1 times [2025-02-07 21:14:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127756144] [2025-02-07 21:14:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-07 21:14:14,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-07 21:14:14,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-07 21:14:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127756144] [2025-02-07 21:14:14,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127756144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306348605] [2025-02-07 21:14:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:14,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:14,538 INFO L87 Difference]: Start difference. First operand 220 states and 277 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:14:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,557 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2025-02-07 21:14:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 153 [2025-02-07 21:14:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,560 INFO L225 Difference]: With dead ends: 324 [2025-02-07 21:14:14,560 INFO L226 Difference]: Without dead ends: 216 [2025-02-07 21:14:14,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,560 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 7 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-07 21:14:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-07 21:14:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 180 states have (on average 1.2166666666666666) internal successors, (219), 180 states have internal predecessors, (219), 27 states have call successors, (27), 10 states have call predecessors, (27), 8 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 21:14:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 271 transitions. [2025-02-07 21:14:14,577 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 271 transitions. Word has length 153 [2025-02-07 21:14:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,578 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 271 transitions. [2025-02-07 21:14:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:14:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 271 transitions. [2025-02-07 21:14:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-07 21:14:14,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,581 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:14:14,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1980829440, now seen corresponding path program 1 times [2025-02-07 21:14:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369357426] [2025-02-07 21:14:14,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-07 21:14:14,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-07 21:14:14,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-02-07 21:14:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369357426] [2025-02-07 21:14:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369357426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616052035] [2025-02-07 21:14:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:14,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:14,768 INFO L87 Difference]: Start difference. First operand 216 states and 271 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 21:14:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,821 INFO L93 Difference]: Finished difference Result 233 states and 287 transitions. [2025-02-07 21:14:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 167 [2025-02-07 21:14:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,824 INFO L225 Difference]: With dead ends: 233 [2025-02-07 21:14:14,824 INFO L226 Difference]: Without dead ends: 199 [2025-02-07 21:14:14,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,824 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 32 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 190 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-07 21:14:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-07 21:14:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 166 states have (on average 1.1927710843373494) internal successors, (198), 166 states have internal predecessors, (198), 24 states have call successors, (24), 10 states have call predecessors, (24), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-07 21:14:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2025-02-07 21:14:14,845 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 167 [2025-02-07 21:14:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2025-02-07 21:14:14,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 21:14:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2025-02-07 21:14:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-07 21:14:14,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,849 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:14:14,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 178188138, now seen corresponding path program 1 times [2025-02-07 21:14:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-02-07 21:14:14,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-07 21:14:14,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-07 21:14:14,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-02-07 21:14:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-02-07 21:14:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975857408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633591164] [2025-02-07 21:14:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:15,006 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 21:14:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,064 INFO L93 Difference]: Finished difference Result 216 states and 260 transitions. [2025-02-07 21:14:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:15,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 169 [2025-02-07 21:14:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,067 INFO L225 Difference]: With dead ends: 216 [2025-02-07 21:14:15,067 INFO L226 Difference]: Without dead ends: 180 [2025-02-07 21:14:15,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,068 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 193 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-07 21:14:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-07 21:14:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 150 states have (on average 1.1666666666666667) internal successors, (175), 150 states have internal predecessors, (175), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-07 21:14:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 215 transitions. [2025-02-07 21:14:15,082 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 215 transitions. Word has length 169 [2025-02-07 21:14:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 215 transitions. [2025-02-07 21:14:15,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 21:14:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 215 transitions. [2025-02-07 21:14:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-07 21:14:15,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,087 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:14:15,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1816063487, now seen corresponding path program 1 times [2025-02-07 21:14:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371997883] [2025-02-07 21:14:15,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-07 21:14:15,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-07 21:14:15,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-07 21:14:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371997883] [2025-02-07 21:14:15,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371997883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412225828] [2025-02-07 21:14:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:15,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,227 INFO L87 Difference]: Start difference. First operand 180 states and 215 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-07 21:14:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,249 INFO L93 Difference]: Finished difference Result 197 states and 231 transitions. [2025-02-07 21:14:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 170 [2025-02-07 21:14:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,254 INFO L225 Difference]: With dead ends: 197 [2025-02-07 21:14:15,254 INFO L226 Difference]: Without dead ends: 180 [2025-02-07 21:14:15,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 21:14:15,256 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-07 21:14:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-07 21:14:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 150 states have (on average 1.1266666666666667) internal successors, (169), 150 states have internal predecessors, (169), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-07 21:14:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2025-02-07 21:14:15,270 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 170 [2025-02-07 21:14:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2025-02-07 21:14:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-07 21:14:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2025-02-07 21:14:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-07 21:14:15,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,274 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:14:15,275 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 488156208, now seen corresponding path program 1 times [2025-02-07 21:14:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413692764] [2025-02-07 21:14:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-07 21:14:15,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-07 21:14:15,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-07 21:14:15,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413692764] [2025-02-07 21:14:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413692764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188298362] [2025-02-07 21:14:15,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:14:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:15,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:14:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:14:15,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-07 21:14:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-07 21:14:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 21:14:15,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:14:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-07 21:14:15,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:14:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-07 21:14:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188298362] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:14:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-02-07 21:14:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087733160] [2025-02-07 21:14:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:15,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,815 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 21:14:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,861 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2025-02-07 21:14:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 176 [2025-02-07 21:14:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,863 INFO L225 Difference]: With dead ends: 217 [2025-02-07 21:14:15,863 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 21:14:15,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,864 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 141 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 21:14:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-07 21:14:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 132 states have internal predecessors, (144), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-07 21:14:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2025-02-07 21:14:15,875 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 176 [2025-02-07 21:14:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,875 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2025-02-07 21:14:15,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 21:14:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2025-02-07 21:14:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-07 21:14:15,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,877 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:14:16,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-07 21:14:16,078 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:16,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1464732923, now seen corresponding path program 1 times [2025-02-07 21:14:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007744255] [2025-02-07 21:14:16,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:16,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-07 21:14:16,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-07 21:14:16,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:16,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-02-07 21:14:16,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:16,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007744255] [2025-02-07 21:14:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007744255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:16,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902916276] [2025-02-07 21:14:16,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:16,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:16,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:16,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:16,232 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-07 21:14:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:16,248 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2025-02-07 21:14:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 200 [2025-02-07 21:14:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:16,249 INFO L225 Difference]: With dead ends: 159 [2025-02-07 21:14:16,249 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:14:16,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:16,250 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:16,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 224 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:14:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:14:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:14:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:14:16,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2025-02-07 21:14:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:16,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:14:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-07 21:14:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:14:16,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:14:16,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:14:16,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:14:16,258 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:16,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:14:16,657 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:14:16,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:14:16 BoogieIcfgContainer [2025-02-07 21:14:16,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:14:16,669 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:14:16,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:14:16,670 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:14:16,670 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:14:11" (3/4) ... [2025-02-07 21:14:16,672 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:14:16,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2025-02-07 21:14:16,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2025-02-07 21:14:16,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assert [2025-02-07 21:14:16,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure add_history_type [2025-02-07 21:14:16,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2025-02-07 21:14:16,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-07 21:14:16,684 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-07 21:14:16,684 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:14:16,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:14:16,711 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(history_id) == history_id) [2025-02-07 21:14:16,742 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(history_id) == history_id) [2025-02-07 21:14:16,778 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:14:16,779 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:14:16,779 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:14:16,780 INFO L158 Benchmark]: Toolchain (without parser) took 6405.68ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 108.4MB in the beginning and 125.6MB in the end (delta: -17.2MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2025-02-07 21:14:16,780 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:14:16,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.06ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 91.6MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:14:16,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.92ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:14:16,781 INFO L158 Benchmark]: Boogie Preprocessor took 51.60ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 85.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:14:16,781 INFO L158 Benchmark]: IcfgBuilder took 731.69ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 50.7MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:14:16,781 INFO L158 Benchmark]: TraceAbstraction took 5107.02ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 50.0MB in the beginning and 133.8MB in the end (delta: -83.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2025-02-07 21:14:16,782 INFO L158 Benchmark]: Witness Printer took 109.50ms. Allocated memory is still 234.9MB. Free memory was 133.8MB in the beginning and 125.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:14:16,784 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.06ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 91.6MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.92ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.60ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 85.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 731.69ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 50.7MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5107.02ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 50.0MB in the beginning and 133.8MB in the end (delta: -83.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Witness Printer took 109.50ms. Allocated memory is still 234.9MB. Free memory was 133.8MB in the beginning and 125.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 539]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 4708 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3125 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 278 IncrementalHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1583 mSDtfsCounter, 278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 450 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=9, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 45 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1826 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2054 ConstructedInterpolants, 0 QuantifiedInterpolants, 2409 SizeOfPredicates, 1 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 4551/4576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 71]: Location Invariant Derived location invariant: (\old(history_id) == history_id) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:14:16,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE