./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.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 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:20,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:20,663 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:22:20,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:20,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:20,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:20,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:20,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:20,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:20,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:20,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:20,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:20,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:20,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:20,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:20,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:20,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:20,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:20,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:20,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:20,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:20,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:20,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:20,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:20,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:20,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:20,706 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 -> 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 [2025-02-07 21:22:20,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:20,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:20,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:20,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:20,994 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:20,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-07 21:22:22,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ab71619d/e8111a68723540159b9b667a57b63be5/FLAGf5dcbc8a2 [2025-02-07 21:22:22,538 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:22:22,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-07 21:22:22,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ab71619d/e8111a68723540159b9b667a57b63be5/FLAGf5dcbc8a2 [2025-02-07 21:22:22,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ab71619d/e8111a68723540159b9b667a57b63be5 [2025-02-07 21:22:22,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:22:22,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:22:22,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:22,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:22:22,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:22:22,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:22" (1/1) ... [2025-02-07 21:22:22,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5732c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:22, skipping insertion in model container [2025-02-07 21:22:22,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:22" (1/1) ... [2025-02-07 21:22:22,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:22:23,035 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2025-02-07 21:22:23,051 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2025-02-07 21:22:23,057 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2025-02-07 21:22:23,059 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2025-02-07 21:22:23,065 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2025-02-07 21:22:23,068 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2025-02-07 21:22:23,072 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2025-02-07 21:22:23,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:23,124 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:22:23,165 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2025-02-07 21:22:23,187 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2025-02-07 21:22:23,195 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2025-02-07 21:22:23,203 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2025-02-07 21:22:23,210 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2025-02-07 21:22:23,212 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2025-02-07 21:22:23,216 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-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2025-02-07 21:22:23,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:23,295 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:22:23,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23 WrapperNode [2025-02-07 21:22:23,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:23,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:23,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:22:23,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:22:23,304 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:22:23" (1/1) ... [2025-02-07 21:22:23,326 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:22:23" (1/1) ... [2025-02-07 21:22:23,392 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1106 [2025-02-07 21:22:23,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:23,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:22:23,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:22:23,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:22:23,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,430 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:22:23,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:22:23,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:22:23,469 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:22:23,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:22:23,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (1/1) ... [2025-02-07 21:22:23,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:23,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:22:23,503 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:22:23,506 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:22:23,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:22:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:22:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:22:23,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:22:23,664 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:22:23,666 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:22:24,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:22:24,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc main_~node3__m3~1#1; [2025-02-07 21:22:24,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:22:24,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:22:24,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1227: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:22:24,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:24,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1559: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:22:24,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:22:24,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node2__m2~2#1; [2025-02-07 21:22:24,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node2__m2~3#1; [2025-02-07 21:22:24,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L938: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:22:24,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:22:24,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1269: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:22:24,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-02-07 21:22:24,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1403: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1337: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L776: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1669: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~check__tmp~9#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;#t~ret17#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: havoc main_~node2__m2~1#1; [2025-02-07 21:22:24,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~node3__m3~5#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node3__m3~2#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1445: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1181: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~node3__m3~4#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1513: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node3__m3~3#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1386: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:22:24,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:22:24,720 INFO L? ?]: Removed 292 outVars from TransFormulas that were not future-live. [2025-02-07 21:22:24,720 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:22:24,737 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:22:24,739 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:22:24,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:24 BoogieIcfgContainer [2025-02-07 21:22:24,740 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:22:24,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:22:24,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:22:24,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:22:24,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:22:22" (1/3) ... [2025-02-07 21:22:24,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3b8643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:24, skipping insertion in model container [2025-02-07 21:22:24,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:23" (2/3) ... [2025-02-07 21:22:24,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3b8643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:24, skipping insertion in model container [2025-02-07 21:22:24,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:24" (3/3) ... [2025-02-07 21:22:24,752 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-07 21:22:24,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:22:24,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 208 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-02-07 21:22:24,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:22:24,862 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;@3e6a65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:22:24,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-07 21:22:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 165 states have (on average 1.993939393939394) internal successors, (329), 206 states have internal predecessors, (329), 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:22:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 21:22:24,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:24,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:24,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:24,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 377694226, now seen corresponding path program 1 times [2025-02-07 21:22:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700195542] [2025-02-07 21:22:24,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:24,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:24,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 21:22:25,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 21:22:25,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:25,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:26,200 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:22:26,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700195542] [2025-02-07 21:22:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700195542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:26,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:22:26,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011597827] [2025-02-07 21:22:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:26,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:22:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:26,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:22:26,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:22:26,231 INFO L87 Difference]: Start difference. First operand has 207 states, 165 states have (on average 1.993939393939394) internal successors, (329), 206 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 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:22:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:27,087 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2025-02-07 21:22:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:22:27,089 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-07 21:22:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:27,096 INFO L225 Difference]: With dead ends: 216 [2025-02-07 21:22:27,099 INFO L226 Difference]: Without dead ends: 107 [2025-02-07 21:22:27,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:22:27,106 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 1052 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:27,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1409 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:22:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-07 21:22:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-07 21:22:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 106 states have internal predecessors, (106), 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:22:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 106 transitions. [2025-02-07 21:22:27,147 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 106 transitions. Word has length 48 [2025-02-07 21:22:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:27,147 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 106 transitions. [2025-02-07 21:22:27,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 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:22:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 106 transitions. [2025-02-07 21:22:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 21:22:27,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:27,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:27,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:22:27,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1049058964, now seen corresponding path program 1 times [2025-02-07 21:22:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302103869] [2025-02-07 21:22:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 21:22:27,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 21:22:27,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:27,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:28,295 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:22:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302103869] [2025-02-07 21:22:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302103869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-07 21:22:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793862667] [2025-02-07 21:22:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:28,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 21:22:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:28,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 21:22:28,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-02-07 21:22:28,301 INFO L87 Difference]: Start difference. First operand 107 states and 106 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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:22:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:29,193 INFO L93 Difference]: Finished difference Result 107 states and 106 transitions. [2025-02-07 21:22:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 21:22:29,194 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-07 21:22:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:29,196 INFO L225 Difference]: With dead ends: 107 [2025-02-07 21:22:29,197 INFO L226 Difference]: Without dead ends: 102 [2025-02-07 21:22:29,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2025-02-07 21:22:29,199 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 165 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:29,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 782 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-07 21:22:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-07 21:22:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 101 states have internal predecessors, (101), 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:22:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 101 transitions. [2025-02-07 21:22:29,206 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 101 transitions. Word has length 48 [2025-02-07 21:22:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:29,206 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 101 transitions. [2025-02-07 21:22:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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:22:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 101 transitions. [2025-02-07 21:22:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 21:22:29,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:29,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:29,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:22:29,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1426173034, now seen corresponding path program 1 times [2025-02-07 21:22:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728819355] [2025-02-07 21:22:29,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:29,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 21:22:29,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 21:22:29,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:29,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:30,228 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:22:30,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728819355] [2025-02-07 21:22:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728819355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-07 21:22:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400239675] [2025-02-07 21:22:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:30,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 21:22:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:30,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 21:22:30,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2025-02-07 21:22:30,232 INFO L87 Difference]: Start difference. First operand 102 states and 101 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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:22:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:31,313 INFO L93 Difference]: Finished difference Result 102 states and 101 transitions. [2025-02-07 21:22:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 21:22:31,314 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-07 21:22:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:31,315 INFO L225 Difference]: With dead ends: 102 [2025-02-07 21:22:31,315 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 21:22:31,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 21:22:31,316 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 206 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:31,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 859 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 21:22:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-07 21:22:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 93 states have internal predecessors, (93), 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:22:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 93 transitions. [2025-02-07 21:22:31,321 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 93 transitions. Word has length 48 [2025-02-07 21:22:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:31,322 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 93 transitions. [2025-02-07 21:22:31,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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:22:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 93 transitions. [2025-02-07 21:22:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 21:22:31,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:31,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:31,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:22:31,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1648792407, now seen corresponding path program 1 times [2025-02-07 21:22:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308595477] [2025-02-07 21:22:31,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:31,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:22:31,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:22:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:31,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:32,061 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:22:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308595477] [2025-02-07 21:22:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308595477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-07 21:22:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081582506] [2025-02-07 21:22:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:32,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 21:22:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:32,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 21:22:32,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:22:32,065 INFO L87 Difference]: Start difference. First operand 94 states and 93 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:22:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:32,718 INFO L93 Difference]: Finished difference Result 94 states and 93 transitions. [2025-02-07 21:22:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:22:32,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-07 21:22:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:32,719 INFO L225 Difference]: With dead ends: 94 [2025-02-07 21:22:32,719 INFO L226 Difference]: Without dead ends: 84 [2025-02-07 21:22:32,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2025-02-07 21:22:32,721 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 167 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:32,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 621 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:22:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-07 21:22:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-07 21:22:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 83 states have internal predecessors, (83), 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:22:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 83 transitions. [2025-02-07 21:22:32,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 83 transitions. Word has length 49 [2025-02-07 21:22:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:32,726 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 83 transitions. [2025-02-07 21:22:32,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:22:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 83 transitions. [2025-02-07 21:22:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 21:22:32,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:32,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:32,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:22:32,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:32,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2092789849, now seen corresponding path program 1 times [2025-02-07 21:22:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:32,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379081501] [2025-02-07 21:22:32,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:32,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:22:32,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:22:32,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:32,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:33,443 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:22:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379081501] [2025-02-07 21:22:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379081501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-07 21:22:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642728674] [2025-02-07 21:22:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 21:22:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:33,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 21:22:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:22:33,445 INFO L87 Difference]: Start difference. First operand 84 states and 83 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:22:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:33,994 INFO L93 Difference]: Finished difference Result 84 states and 83 transitions. [2025-02-07 21:22:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:22:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-07 21:22:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:33,995 INFO L225 Difference]: With dead ends: 84 [2025-02-07 21:22:33,995 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 21:22:33,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-02-07 21:22:33,996 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 206 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 465 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:22:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 21:22:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-07 21:22:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 76 states have internal predecessors, (76), 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:22:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 76 transitions. [2025-02-07 21:22:33,999 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 76 transitions. Word has length 49 [2025-02-07 21:22:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:34,000 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 76 transitions. [2025-02-07 21:22:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:22:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 76 transitions. [2025-02-07 21:22:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 21:22:34,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:34,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:34,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:22:34,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:34,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1983645341, now seen corresponding path program 1 times [2025-02-07 21:22:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249095144] [2025-02-07 21:22:34,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:34,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:22:34,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:22:34,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:34,712 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:22:34,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:34,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249095144] [2025-02-07 21:22:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249095144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-07 21:22:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283557957] [2025-02-07 21:22:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 21:22:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:34,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 21:22:34,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:22:34,715 INFO L87 Difference]: Start difference. First operand 77 states and 76 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:22:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:35,384 INFO L93 Difference]: Finished difference Result 77 states and 76 transitions. [2025-02-07 21:22:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:22:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-07 21:22:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:35,386 INFO L225 Difference]: With dead ends: 77 [2025-02-07 21:22:35,387 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 21:22:35,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2025-02-07 21:22:35,388 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 185 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:35,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 433 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:22:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 21:22:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-07 21:22:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 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:22:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2025-02-07 21:22:35,395 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 49 [2025-02-07 21:22:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:35,395 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2025-02-07 21:22:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:22:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2025-02-07 21:22:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-07 21:22:35,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:35,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:35,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:22:35,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 21:22:35,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash -591487738, now seen corresponding path program 1 times [2025-02-07 21:22:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:35,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973000977] [2025-02-07 21:22:35,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-07 21:22:35,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 21:22:35,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:35,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:35,448 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:22:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973000977] [2025-02-07 21:22:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973000977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:35,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:22:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279092798] [2025-02-07 21:22:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:35,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:22:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:35,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:22:35,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:22:35,450 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:22:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:35,460 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2025-02-07 21:22:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:22:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-07 21:22:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:35,461 INFO L225 Difference]: With dead ends: 64 [2025-02-07 21:22:35,461 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:22:35,462 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:22:35,463 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:35,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:22:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:22:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:22:35,463 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:22:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:22:35,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-02-07 21:22:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:22:35,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:22:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:22:35,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:22:35,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-02-07 21:22:35,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-02-07 21:22:35,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-02-07 21:22:35,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-02-07 21:22:35,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-02-07 21:22:35,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-02-07 21:22:35,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-02-07 21:22:35,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:22:35,474 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:35,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:22:35,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:22:35,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:22:35 BoogieIcfgContainer [2025-02-07 21:22:35,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:22:35,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:22:35,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:22:35,488 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:22:35,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:24" (3/4) ... [2025-02-07 21:22:35,491 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:22:35,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:22:35,514 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:22:35,515 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:22:35,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:22:35,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:22:35,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:22:35,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:22:35,657 INFO L158 Benchmark]: Toolchain (without parser) took 12821.00ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 121.2MB in the beginning and 124.5MB in the end (delta: -3.3MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2025-02-07 21:22:35,657 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:22:35,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.04ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 96.3MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:22:35,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.59ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 91.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:22:35,658 INFO L158 Benchmark]: Boogie Preprocessor took 71.78ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 87.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:22:35,658 INFO L158 Benchmark]: IcfgBuilder took 1271.82ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 102.1MB in the end (delta: -14.5MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2025-02-07 21:22:35,659 INFO L158 Benchmark]: TraceAbstraction took 10745.32ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 101.2MB in the beginning and 138.6MB in the end (delta: -37.4MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-02-07 21:22:35,659 INFO L158 Benchmark]: Witness Printer took 168.11ms. Allocated memory is still 243.3MB. Free memory was 138.6MB in the beginning and 124.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:22:35,661 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.27ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.04ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 96.3MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.59ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 91.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.78ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 87.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1271.82ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 102.1MB in the end (delta: -14.5MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10745.32ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 101.2MB in the beginning and 138.6MB in the end (delta: -37.4MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 168.11ms. Allocated memory is still 243.3MB. Free memory was 138.6MB in the beginning and 124.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. 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: 400]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 648]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 736]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 783]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 898]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 945]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1020]: 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 1 procedures, 208 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1981 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1981 mSDsluCounter, 4680 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4059 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2240 IncrementalHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 621 mSDtfsCounter, 2240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=0, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 6137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:22:35,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE