./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.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.UNBOUNDED.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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:14:08,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:14:08,327 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,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:14:08,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:14:08,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:14:08,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:14:08,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:14:08,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:14:08,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:14:08,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:14:08,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:14:08,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:14:08,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:14:08,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:14:08,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:14:08,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:14:08,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:14:08,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:14:08,351 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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2025-02-07 21:14:08,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:14:08,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:14:08,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:14:08,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:14:08,584 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:14:08,584 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.UNBOUNDED.pals.c [2025-02-07 21:14:09,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31e7b0891/eb387fad3b9b4989bb5e53c01f931c9f/FLAG352d0ea11 [2025-02-07 21:14:09,973 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:14:09,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-02-07 21:14:09,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31e7b0891/eb387fad3b9b4989bb5e53c01f931c9f/FLAG352d0ea11 [2025-02-07 21:14:10,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31e7b0891/eb387fad3b9b4989bb5e53c01f931c9f [2025-02-07 21:14:10,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:14:10,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:14:10,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:14:10,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:14:10,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:14:10,305 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,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf 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,307 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,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:14:10,505 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.UNBOUNDED.pals.c[12106,12119] [2025-02-07 21:14:10,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:14:10,520 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:14:10,575 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.UNBOUNDED.pals.c[12106,12119] [2025-02-07 21:14:10,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:14:10,591 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:14:10,592 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,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:14:10,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:14:10,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:14:10,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:14:10,598 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,606 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,641 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 418 [2025-02-07 21:14:10,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:14:10,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:14:10,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:14:10,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:14:10,650 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,650 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,653 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,664 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,665 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,665 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,670 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,671 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,672 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,673 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,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:14:10,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:14:10,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:14:10,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:14:10,677 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,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:14:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:10,708 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,715 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,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:14:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-02-07 21:14:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:14:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-02-07 21:14:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-02-07 21:14:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-02-07 21:14:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:14:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:14:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:14:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:14:10,821 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:14:10,823 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:14:11,178 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume ~VALUE1~0 != ~VALUE2~0; [2025-02-07 21:14:11,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume !(~VALUE1~0 != ~VALUE2~0); [2025-02-07 21:14:11,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: assume 0 != check_~tmp___7~0#1 % 256; [2025-02-07 21:14:11,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: assume !(0 != check_~tmp___7~0#1 % 256);check_#res#1 := 0; [2025-02-07 21:14:11,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L275-1: SUMMARY for call check_#t~ret18#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume 0 == check_~tmp___4~0#1 % 256; [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume !(0 == check_~tmp___4~0#1 % 256); [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325-1: SUMMARY for call check_#t~ret28#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(0 == gate3_each_pals_period_~next_state~2#1); [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume ~VALUE1~0 != ~VALUE3~0; [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume !(~VALUE1~0 != ~VALUE3~0); [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: SUMMARY for call check_#t~ret25#1 := read_history_bool(1, 1); srcloc: null [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: assume !(~VALUE2~0 == check_~tmp___1~2#1); [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: assume !(~VALUE1~0 != ~nomsg~0); [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: 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,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268-1: SUMMARY for call check_#t~ret15#1 := read_history_bool(2, 1); srcloc: null [2025-02-07 21:14:11,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L458: assume ~VALUE2~0 == ~VALUE3~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L458: assume !(~VALUE2~0 == ~VALUE3~0); [2025-02-07 21:14:11,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: 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,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume !(3 == write_history_int8_~history_id#1); [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume !(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume !!(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume ~VALUE2~0 != ~VALUE3~0; [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume !(~VALUE2~0 != ~VALUE3~0); [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume !(0 == ~gate1Failed~0 % 256); [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: SUMMARY for call assert(0); srcloc: null [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L409: SUMMARY for call write_history_bool(2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1)); srcloc: null [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: assume 0 != check_~tmp___8~0#1 % 256; [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: assume !(0 != check_~tmp___8~0#1 % 256);check_#res#1 := 0; [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume 0 == check_~tmp___5~0#1 % 256;check_~temp_count~0#1 := 0; [2025-02-07 21:14:11,184 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume !(0 == check_~tmp___5~0#1 % 256); [2025-02-07 21:14:11,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: 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,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327-1: SUMMARY for call check_#t~ret29#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: 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,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L451: assume ~VALUE1~0 == ~VALUE3~0; [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L451: assume !(~VALUE1~0 == ~VALUE3~0); [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: 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,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume !(0 == gate2_each_pals_period_~next_state~1#1); [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: assume !(1 == check_~temp_count~0#1);check_#res#1 := 0; [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: assume !!(1 == check_~temp_count~0#1); [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: 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,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: 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,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: 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,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311-1: SUMMARY for call check_#t~ret26#1 := read_history_bool(2, 1); srcloc: null [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L336-1: check_#res#1 := 1; [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: 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,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303-1: SUMMARY for call check_#t~ret22#1 := read_history_int8(3, 1); srcloc: null [2025-02-07 21:14:11,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: assume ~VALUE2~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: assume !(~VALUE2~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427: ~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,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427-1: SUMMARY for call assume_abort_if_not((if (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:14:11,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: assume !(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-07 21:14:11,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: assume !!(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: 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,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: 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,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume !(1 == gate3_each_pals_period_~next_state~2#1); [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: 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,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L477-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,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: assume ~VALUE1~0 == ~VALUE2~0; [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: assume !(~VALUE1~0 == ~VALUE2~0); [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: SUMMARY for call write_history_bool(1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1)); srcloc: null [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume 0 == check_~tmp___9~0#1 % 256;check_#res#1 := 0; [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume !(0 == check_~tmp___9~0#1 % 256); [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: 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,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: SUMMARY for call check_#t~ret20#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L469: assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L469: assume !(~VALUE2~0 != ~nomsg~0); [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: assume check_~tmp___10~0#1 > -2; [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: assume !(check_~tmp___10~0#1 > -2); [2025-02-07 21:14:11,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: 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,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271-1: SUMMARY for call check_#t~ret16#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329-1: SUMMARY for call check_#t~ret30#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: SUMMARY for call assume_abort_if_not((if (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L519: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume !(0 == ~gate2Failed~0 % 256); [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume !(~VALUE3~0 == check_~tmp___2~2#1); [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: SUMMARY for call assert((if 0 == main_~c1~0#1 then 0 else 1)); srcloc: null [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305-1: SUMMARY for call check_#t~ret23#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: 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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: assume !(~VALUE1~0 == check_~tmp___0~2#1); [2025-02-07 21:14:11,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: ~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,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396-1: SUMMARY for call assume_abort_if_not((if (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !(~VALUE3~0 == check_~tmp___14~0#1);check_#res#1 := 0; [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !!(~VALUE3~0 == check_~tmp___14~0#1); [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: assume !(check_~temp_count~0#1 > 1);check_#res#1 := 0; [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: assume !!(check_~temp_count~0#1 > 1); [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: 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,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: 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,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264-1: SUMMARY for call check_#t~ret13#1 := read_history_bool(0, 1); srcloc: null [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: 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,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume !(1 == gate2_each_pals_period_~next_state~1#1); [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: assume check_~tmp___6~0#1 == ~nomsg~0; [2025-02-07 21:14:11,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: assume !(check_~tmp___6~0#1 == ~nomsg~0); [2025-02-07 21:14:11,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L174: SUMMARY for call assert(0); srcloc: null [2025-02-07 21:14:11,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume 0 == check_~tmp___3~0#1 % 256; [2025-02-07 21:14:11,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume !(0 == check_~tmp___3~0#1 % 256); [2025-02-07 21:14:11,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: 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,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: 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,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: 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,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323-1: SUMMARY for call check_#t~ret27#1 := read_history_int8(3, 0); srcloc: null [2025-02-07 21:14:11,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: assume ~VALUE3~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; [2025-02-07 21:14:11,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: assume !(~VALUE3~0 != ~nomsg~0); [2025-02-07 21:14:11,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: 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,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307-1: SUMMARY for call check_#t~ret24#1 := read_history_bool(0, 1); srcloc: null [2025-02-07 21:14:11,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: 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,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266-1: SUMMARY for call check_#t~ret14#1 := read_history_bool(1, 1); srcloc: null [2025-02-07 21:14:11,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume check_~tmp___11~0#1 != ~nomsg~0; [2025-02-07 21:14:11,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume !(check_~tmp___11~0#1 != ~nomsg~0); [2025-02-07 21:14:11,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-07 21:14:11,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; [2025-02-07 21:14:11,272 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-02-07 21:14:11,272 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:14:11,281 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:14:11,282 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:14:11,282 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,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:14:11,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:14:11,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:14:11,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:14:11,287 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,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a4647e 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,288 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,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a4647e 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,289 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,289 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-02-07 21:14:11,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:14:11,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c that has 7 procedures, 87 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:14:11,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:14:11,347 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;@15023df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:14:11,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:14:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 67 states have internal predecessors, (99), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 21:14:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 21:14:11,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,367 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,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash 631260206, now seen corresponding path program 1 times [2025-02-07 21:14:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-02-07 21:14:11,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 21:14:11,535 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,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,651 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,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-02-07 21:14:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136880358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384811832] [2025-02-07 21:14:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:11,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:11,669 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 67 states have internal predecessors, (99), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,717 INFO L93 Difference]: Finished difference Result 176 states and 272 transitions. [2025-02-07 21:14:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:11,719 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:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,723 INFO L225 Difference]: With dead ends: 176 [2025-02-07 21:14:11,723 INFO L226 Difference]: Without dead ends: 81 [2025-02-07 21:14:11,727 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:11,728 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 7 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 353 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:11,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 353 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:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-07 21:14:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-07 21:14:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 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:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2025-02-07 21:14:11,755 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 14 [2025-02-07 21:14:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,755 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2025-02-07 21:14:11,756 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:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2025-02-07 21:14:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 21:14:11,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,757 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:11,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:14:11,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1715369209, now seen corresponding path program 1 times [2025-02-07 21:14:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790014755] [2025-02-07 21:14:11,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 21:14:11,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 21:14:11,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,828 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,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790014755] [2025-02-07 21:14:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790014755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620740159] [2025-02-07 21:14:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:11,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:11,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:11,830 INFO L87 Difference]: Start difference. First operand 81 states and 109 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:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,867 INFO L93 Difference]: Finished difference Result 174 states and 240 transitions. [2025-02-07 21:14:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:11,867 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:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,869 INFO L225 Difference]: With dead ends: 174 [2025-02-07 21:14:11,870 INFO L226 Difference]: Without dead ends: 95 [2025-02-07 21:14:11,870 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:11,871 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 22 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 296 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:11,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 296 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:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-07 21:14:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-07 21:14:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.380281690140845) internal successors, (98), 72 states have internal predecessors, (98), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 21:14:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2025-02-07 21:14:11,880 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 15 [2025-02-07 21:14:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,880 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2025-02-07 21:14:11,880 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:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2025-02-07 21:14:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 21:14:11,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,881 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:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:14:11,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1764085992, now seen corresponding path program 1 times [2025-02-07 21:14:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287664447] [2025-02-07 21:14:11,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 21:14:11,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 21:14:11,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,946 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:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287664447] [2025-02-07 21:14:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287664447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079456035] [2025-02-07 21:14:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,948 INFO L87 Difference]: Start difference. First operand 93 states and 124 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:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,968 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2025-02-07 21:14:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,969 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:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,970 INFO L225 Difference]: With dead ends: 206 [2025-02-07 21:14:11,970 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 21:14:11,971 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:11,971 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 22 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 204 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:11,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 204 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:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 21:14:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2025-02-07 21:14:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 21:14:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2025-02-07 21:14:11,984 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 22 [2025-02-07 21:14:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,984 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2025-02-07 21:14:11,984 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:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2025-02-07 21:14:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 21:14:11,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,985 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:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:14:11,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash 568971525, now seen corresponding path program 1 times [2025-02-07 21:14:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182580395] [2025-02-07 21:14:11,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 21:14:12,002 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,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,080 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,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182580395] [2025-02-07 21:14:12,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182580395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974513571] [2025-02-07 21:14:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:12,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,081 INFO L87 Difference]: Start difference. First operand 95 states and 126 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,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,106 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2025-02-07 21:14:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,106 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,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,108 INFO L225 Difference]: With dead ends: 182 [2025-02-07 21:14:12,108 INFO L226 Difference]: Without dead ends: 97 [2025-02-07 21:14:12,108 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,109 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 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,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 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,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-07 21:14:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-02-07 21:14:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.356164383561644) internal successors, (99), 74 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 21:14:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2025-02-07 21:14:12,116 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 31 [2025-02-07 21:14:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,116 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-02-07 21:14:12,116 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,116 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2025-02-07 21:14:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:14:12,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,117 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,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:14:12,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1470162459, now seen corresponding path program 1 times [2025-02-07 21:14:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841019837] [2025-02-07 21:14:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:14:12,132 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,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,179 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,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841019837] [2025-02-07 21:14:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841019837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722568983] [2025-02-07 21:14:12,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:14:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:12,186 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,194 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,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:14:12,303 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,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:14:12,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:14:12,337 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,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:14:12,369 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,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722568983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:14:12,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:14:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:14:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891441295] [2025-02-07 21:14:12,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:12,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:12,371 INFO L87 Difference]: Start difference. First operand 95 states and 125 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:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,407 INFO L93 Difference]: Finished difference Result 239 states and 338 transitions. [2025-02-07 21:14:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,408 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:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,409 INFO L225 Difference]: With dead ends: 239 [2025-02-07 21:14:12,409 INFO L226 Difference]: Without dead ends: 154 [2025-02-07 21:14:12,410 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:12,410 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 246 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-07 21:14:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-02-07 21:14:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 117 states have internal predecessors, (158), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-07 21:14:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 204 transitions. [2025-02-07 21:14:12,422 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 204 transitions. Word has length 33 [2025-02-07 21:14:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,423 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 204 transitions. [2025-02-07 21:14:12,423 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:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 204 transitions. [2025-02-07 21:14:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 21:14:12,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,424 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:12,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:14:12,624 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:12,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash -585727995, now seen corresponding path program 2 times [2025-02-07 21:14:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474689052] [2025-02-07 21:14:12,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:14:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-07 21:14:12,648 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:12,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:14:12,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,690 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:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474689052] [2025-02-07 21:14:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474689052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:12,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927980885] [2025-02-07 21:14:12,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:12,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:12,691 INFO L87 Difference]: Start difference. First operand 148 states and 204 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:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,722 INFO L93 Difference]: Finished difference Result 276 states and 392 transitions. [2025-02-07 21:14:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:12,722 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:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,724 INFO L225 Difference]: With dead ends: 276 [2025-02-07 21:14:12,724 INFO L226 Difference]: Without dead ends: 155 [2025-02-07 21:14:12,724 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:12,725 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 292 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:12,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 292 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:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-07 21:14:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-07 21:14:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.360655737704918) internal successors, (166), 123 states have internal predecessors, (166), 24 states have call successors, (24), 9 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:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2025-02-07 21:14:12,741 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 55 [2025-02-07 21:14:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2025-02-07 21:14:12,741 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:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2025-02-07 21:14:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 21:14:12,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,743 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:12,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:14:12,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1830844145, now seen corresponding path program 1 times [2025-02-07 21:14:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596489237] [2025-02-07 21:14:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 21:14:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 21:14:12,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,835 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:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596489237] [2025-02-07 21:14:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596489237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380400415] [2025-02-07 21:14:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:12,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:12,836 INFO L87 Difference]: Start difference. First operand 155 states and 212 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:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,882 INFO L93 Difference]: Finished difference Result 320 states and 450 transitions. [2025-02-07 21:14:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,885 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:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,887 INFO L225 Difference]: With dead ends: 320 [2025-02-07 21:14:12,887 INFO L226 Difference]: Without dead ends: 192 [2025-02-07 21:14:12,887 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:12,888 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 22 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 295 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:12,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 295 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:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-07 21:14:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2025-02-07 21:14:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 154 states have internal predecessors, (202), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 21:14:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2025-02-07 21:14:12,900 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 55 [2025-02-07 21:14:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,900 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2025-02-07 21:14:12,900 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:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2025-02-07 21:14:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 21:14:12,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,902 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:12,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:14:12,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash 521076271, now seen corresponding path program 1 times [2025-02-07 21:14:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516544365] [2025-02-07 21:14:12,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 21:14:12,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 21:14:12,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,987 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:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516544365] [2025-02-07 21:14:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516544365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725015425] [2025-02-07 21:14:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:12,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,992 INFO L87 Difference]: Start difference. First operand 190 states and 254 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,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,029 INFO L93 Difference]: Finished difference Result 332 states and 450 transitions. [2025-02-07 21:14:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,029 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,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,031 INFO L225 Difference]: With dead ends: 332 [2025-02-07 21:14:13,031 INFO L226 Difference]: Without dead ends: 192 [2025-02-07 21:14:13,031 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,033 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 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,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-07 21:14:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2025-02-07 21:14:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 154 states have internal predecessors, (199), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 21:14:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 251 transitions. [2025-02-07 21:14:13,054 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 251 transitions. Word has length 73 [2025-02-07 21:14:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,056 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 251 transitions. [2025-02-07 21:14:13,056 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,056 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 251 transitions. [2025-02-07 21:14:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-07 21:14:13,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,058 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,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:14:13,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 962974319, now seen corresponding path program 1 times [2025-02-07 21:14:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856900250] [2025-02-07 21:14:13,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-07 21:14:13,090 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,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,190 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,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856900250] [2025-02-07 21:14:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856900250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549651206] [2025-02-07 21:14:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,191 INFO L87 Difference]: Start difference. First operand 190 states and 251 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:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,236 INFO L93 Difference]: Finished difference Result 367 states and 504 transitions. [2025-02-07 21:14:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,236 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:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,239 INFO L225 Difference]: With dead ends: 367 [2025-02-07 21:14:13,239 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:13,240 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,240 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 23 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 295 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:13,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 295 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:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-02-07 21:14:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 189 states have (on average 1.2698412698412698) internal successors, (240), 190 states have internal predecessors, (240), 30 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-07 21:14:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 298 transitions. [2025-02-07 21:14:13,260 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 298 transitions. Word has length 101 [2025-02-07 21:14:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,260 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 298 transitions. [2025-02-07 21:14:13,260 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:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 298 transitions. [2025-02-07 21:14:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-07 21:14:13,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,261 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:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:14:13,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 523612200, now seen corresponding path program 1 times [2025-02-07 21:14:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10206722] [2025-02-07 21:14:13,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-07 21:14:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-07 21:14:13,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,345 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:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10206722] [2025-02-07 21:14:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10206722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496924754] [2025-02-07 21:14:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,347 INFO L87 Difference]: Start difference. First operand 230 states and 298 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:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,379 INFO L93 Difference]: Finished difference Result 393 states and 522 transitions. [2025-02-07 21:14:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:13,380 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:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,381 INFO L225 Difference]: With dead ends: 393 [2025-02-07 21:14:13,381 INFO L226 Difference]: Without dead ends: 224 [2025-02-07 21:14:13,382 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,382 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 275 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:13,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 275 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:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-07 21:14:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-02-07 21:14:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.2391304347826086) internal successors, (228), 185 states have internal predecessors, (228), 29 states have call successors, (29), 11 states have call predecessors, (29), 10 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-07 21:14:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2025-02-07 21:14:13,394 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 102 [2025-02-07 21:14:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,394 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2025-02-07 21:14:13,394 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:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2025-02-07 21:14:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-07 21:14:13,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,395 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:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:14:13,396 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash 812754883, now seen corresponding path program 1 times [2025-02-07 21:14:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606668867] [2025-02-07 21:14:13,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 21:14:13,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 21:14:13,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,502 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:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606668867] [2025-02-07 21:14:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606668867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317666436] [2025-02-07 21:14:13,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:13,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:13,504 INFO L87 Difference]: Start difference. First operand 224 states and 284 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:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,540 INFO L93 Difference]: Finished difference Result 369 states and 474 transitions. [2025-02-07 21:14:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,541 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:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,542 INFO L225 Difference]: With dead ends: 369 [2025-02-07 21:14:13,542 INFO L226 Difference]: Without dead ends: 226 [2025-02-07 21:14:13,543 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,545 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,545 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,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-07 21:14:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2025-02-07 21:14:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 185 states have internal predecessors, (225), 29 states have call successors, (29), 11 states have call predecessors, (29), 10 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-07 21:14:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2025-02-07 21:14:13,564 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 121 [2025-02-07 21:14:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,564 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2025-02-07 21:14:13,564 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:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2025-02-07 21:14:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-07 21:14:13,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,565 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:13,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:14:13,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 955430723, now seen corresponding path program 1 times [2025-02-07 21:14:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-02-07 21:14:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-07 21:14:13,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-07 21:14:13,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,716 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:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-02-07 21:14:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256921885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867523735] [2025-02-07 21:14:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,717 INFO L87 Difference]: Start difference. First operand 224 states and 281 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:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,736 INFO L93 Difference]: Finished difference Result 332 states and 425 transitions. [2025-02-07 21:14:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:13,737 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:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,738 INFO L225 Difference]: With dead ends: 332 [2025-02-07 21:14:13,738 INFO L226 Difference]: Without dead ends: 220 [2025-02-07 21:14:13,739 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:13,739 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 267 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:13,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 267 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:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-07 21:14:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-07 21:14:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.2142857142857142) internal successors, (221), 182 states have internal predecessors, (221), 28 states have call successors, (28), 11 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:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 275 transitions. [2025-02-07 21:14:13,751 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 275 transitions. Word has length 153 [2025-02-07 21:14:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,752 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 275 transitions. [2025-02-07 21:14:13,752 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:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 275 transitions. [2025-02-07 21:14:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-07 21:14:13,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,754 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, 1, 1, 1, 1] [2025-02-07 21:14:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:14:13,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1583005045, now seen corresponding path program 1 times [2025-02-07 21:14:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-02-07 21:14:13,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-07 21:14:13,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-07 21:14:13,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,877 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:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-02-07 21:14:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542475783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908417726] [2025-02-07 21:14:13,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:13,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:13,880 INFO L87 Difference]: Start difference. First operand 220 states and 275 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 21:14:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,930 INFO L93 Difference]: Finished difference Result 241 states and 295 transitions. [2025-02-07 21:14:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 171 [2025-02-07 21:14:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,933 INFO L225 Difference]: With dead ends: 241 [2025-02-07 21:14:13,933 INFO L226 Difference]: Without dead ends: 203 [2025-02-07 21:14:13,933 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,933 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 202 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:13,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 202 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:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-07 21:14:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-07 21:14:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 168 states have internal predecessors, (200), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-07 21:14:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 248 transitions. [2025-02-07 21:14:13,948 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 248 transitions. Word has length 171 [2025-02-07 21:14:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,948 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 248 transitions. [2025-02-07 21:14:13,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 21:14:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 248 transitions. [2025-02-07 21:14:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-07 21:14:13,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,950 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, 1, 1, 1, 1] [2025-02-07 21:14:13,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:14:13,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 40288639, now seen corresponding path program 1 times [2025-02-07 21:14:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108647614] [2025-02-07 21:14:13,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-07 21:14:13,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-07 21:14:13,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,057 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:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108647614] [2025-02-07 21:14:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108647614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534360508] [2025-02-07 21:14:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:14,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:14,059 INFO L87 Difference]: Start difference. First operand 203 states and 248 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 21:14:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,107 INFO L93 Difference]: Finished difference Result 224 states and 268 transitions. [2025-02-07 21:14:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 173 [2025-02-07 21:14:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,109 INFO L225 Difference]: With dead ends: 224 [2025-02-07 21:14:14,109 INFO L226 Difference]: Without dead ends: 184 [2025-02-07 21:14:14,109 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,110 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 28 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 205 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,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 205 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,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-07 21:14:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-07 21:14:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.1644736842105263) internal successors, (177), 152 states have internal predecessors, (177), 22 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-07 21:14:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2025-02-07 21:14:14,118 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 173 [2025-02-07 21:14:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,118 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2025-02-07 21:14:14,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 21:14:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2025-02-07 21:14:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-07 21:14:14,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,120 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, 1, 1, 1, 1] [2025-02-07 21:14:14,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:14:14,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1089826124, now seen corresponding path program 1 times [2025-02-07 21:14:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164805248] [2025-02-07 21:14:14,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-07 21:14:14,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-07 21:14:14,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,219 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:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164805248] [2025-02-07 21:14:14,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164805248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132487895] [2025-02-07 21:14:14,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:14,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,221 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-07 21:14:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,239 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2025-02-07 21:14:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 174 [2025-02-07 21:14:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,241 INFO L225 Difference]: With dead ends: 205 [2025-02-07 21:14:14,241 INFO L226 Difference]: Without dead ends: 184 [2025-02-07 21:14:14,242 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,242 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 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:14,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 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:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-07 21:14:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-07 21:14:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.125) internal successors, (171), 152 states have internal predecessors, (171), 22 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-07 21:14:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 213 transitions. [2025-02-07 21:14:14,251 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 213 transitions. Word has length 174 [2025-02-07 21:14:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 213 transitions. [2025-02-07 21:14:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-07 21:14:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 213 transitions. [2025-02-07 21:14:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-07 21:14:14,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,252 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, 1, 1, 1, 1] [2025-02-07 21:14:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:14:14,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1112772285, now seen corresponding path program 1 times [2025-02-07 21:14:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202466443] [2025-02-07 21:14:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-07 21:14:14,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-07 21:14:14,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,341 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:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202466443] [2025-02-07 21:14:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202466443] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157133291] [2025-02-07 21:14:14,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:14:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:14,343 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:14,348 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:14,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-07 21:14:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-07 21:14:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 21:14:14,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:14:14,554 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:14,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:14:14,710 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:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157133291] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:14:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-02-07 21:14:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453137161] [2025-02-07 21:14:14,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:14,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,711 INFO L87 Difference]: Start difference. First operand 184 states and 213 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 21:14:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,748 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2025-02-07 21:14:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 180 [2025-02-07 21:14:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,750 INFO L225 Difference]: With dead ends: 225 [2025-02-07 21:14:14,750 INFO L226 Difference]: Without dead ends: 163 [2025-02-07 21:14:14,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 359 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,751 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 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:14,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 149 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:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-07 21:14:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-07 21:14:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 134 states have internal predecessors, (146), 19 states have call successors, (19), 11 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-07 21:14:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 182 transitions. [2025-02-07 21:14:14,764 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 182 transitions. Word has length 180 [2025-02-07 21:14:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,764 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 182 transitions. [2025-02-07 21:14:14,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 21:14:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 182 transitions. [2025-02-07 21:14:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-07 21:14:14,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,765 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, 1, 1, 1, 1] [2025-02-07 21:14:14,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 21:14:14,966 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:14,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1339120008, now seen corresponding path program 1 times [2025-02-07 21:14:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374509025] [2025-02-07 21:14:14,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-07 21:14:14,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-07 21:14:14,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,071 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:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374509025] [2025-02-07 21:14:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374509025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:14:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886702272] [2025-02-07 21:14:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:14:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:14:15,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:14:15,072 INFO L87 Difference]: Start difference. First operand 163 states and 182 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-07 21:14:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,085 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2025-02-07 21:14:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 204 [2025-02-07 21:14:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,086 INFO L225 Difference]: With dead ends: 163 [2025-02-07 21:14:15,086 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:14:15,086 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:15,087 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 236 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:15,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 236 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:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:14:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:14:15,087 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:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:14:15,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-02-07 21:14:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,087 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:14:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-07 21:14:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:14:15,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:14:15,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:14:15,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:14:15,093 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:15,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:14:15,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:14:15,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:14:15 BoogieIcfgContainer [2025-02-07 21:14:15,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:14:15,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:14:15,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:14:15,385 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:14:15,385 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:15,386 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:14:15,390 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2025-02-07 21:14:15,390 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2025-02-07 21:14:15,390 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assert [2025-02-07 21:14:15,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure add_history_type [2025-02-07 21:14:15,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-07 21:14:15,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2025-02-07 21:14:15,394 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-07 21:14:15,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-07 21:14:15,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:14:15,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:14:15,413 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(history_id) == history_id) [2025-02-07 21:14:15,432 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(history_id) == history_id) [2025-02-07 21:14:15,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:14:15,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:14:15,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:14:15,477 INFO L158 Benchmark]: Toolchain (without parser) took 5176.55ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 116.3MB in the beginning and 65.5MB in the end (delta: 50.8MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2025-02-07 21:14:15,477 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:14:15,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.87ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 99.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:14:15,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.87ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:14:15,477 INFO L158 Benchmark]: Boogie Preprocessor took 33.60ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:14:15,477 INFO L158 Benchmark]: IcfgBuilder took 606.71ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 57.7MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:14:15,478 INFO L158 Benchmark]: TraceAbstraction took 4100.29ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 57.2MB in the beginning and 73.7MB in the end (delta: -16.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2025-02-07 21:14:15,478 INFO L158 Benchmark]: Witness Printer took 91.67ms. Allocated memory is still 176.2MB. Free memory was 73.7MB in the beginning and 65.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:14:15,479 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.87ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 99.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.87ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.60ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 606.71ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 57.7MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4100.29ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 57.2MB in the beginning and 73.7MB in the end (delta: -16.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Witness Printer took 91.67ms. Allocated memory is still 176.2MB. Free memory was 73.7MB in the beginning and 65.5MB in the end (delta: 8.3MB). 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: 541]: 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 7 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 325 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 4843 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3193 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1650 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred 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.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1890 NumberOfCodeBlocks, 1850 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2082 ConstructedInterpolants, 0 QuantifiedInterpolants, 2437 SizeOfPredicates, 1 NumberOfNonLiveVariables, 742 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: 74]: Location Invariant Derived location invariant: (\old(history_id) == history_id) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:14:15,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE