./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48263e5b2fdfa125a212d9dd2b1aa7b4bc28734093ef4904b2507084a0cf2933 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:38:58,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:38:58,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:38:58,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:38:58,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:38:58,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:38:58,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:38:58,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:38:58,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:38:58,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:38:58,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:38:58,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:38:58,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:38:58,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:38:58,477 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:38:58,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:38:58,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:38:58,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:38:58,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:38:58,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:38:58,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:38:58,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48263e5b2fdfa125a212d9dd2b1aa7b4bc28734093ef4904b2507084a0cf2933 [2025-03-03 15:38:58,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:38:58,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:38:58,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:38:58,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:38:58,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:38:58,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c [2025-03-03 15:38:59,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9f0c048/9d81a83963a6416e9a0cd0562ba52ff5/FLAGd4242e05d [2025-03-03 15:39:00,481 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:39:00,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c [2025-03-03 15:39:00,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9f0c048/9d81a83963a6416e9a0cd0562ba52ff5/FLAGd4242e05d [2025-03-03 15:39:00,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9f0c048/9d81a83963a6416e9a0cd0562ba52ff5 [2025-03-03 15:39:00,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:39:00,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:39:00,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:39:00,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:39:00,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:39:00,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:39:00" (1/1) ... [2025-03-03 15:39:00,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2699d0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:00, skipping insertion in model container [2025-03-03 15:39:00,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:39:00" (1/1) ... [2025-03-03 15:39:00,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:39:01,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c[378560,378573] [2025-03-03 15:39:01,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c[383339,383352] [2025-03-03 15:39:02,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:39:02,026 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:39:02,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c[378560,378573] [2025-03-03 15:39:02,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-2.c[383339,383352] [2025-03-03 15:39:02,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:39:02,588 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:39:02,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02 WrapperNode [2025-03-03 15:39:02,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:39:02,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:39:02,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:39:02,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:39:02,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:02,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:02,992 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13185 [2025-03-03 15:39:02,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:39:02,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:39:02,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:39:02,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:39:03,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,122 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:39:03,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:39:03,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:39:03,429 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:39:03,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:39:03,430 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (1/1) ... [2025-03-03 15:39:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:39:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:03,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:39:03,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:39:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:39:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:39:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:39:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:39:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:39:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:39:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:39:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:39:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:39:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:39:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:39:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:39:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:39:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:39:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:39:03,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:39:03,592 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:39:03,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:39:09,642 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:39:09,643 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:39:09,643 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:39:09,643 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:39:09,644 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:39:09,644 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:39:09,644 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:39:09,852 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2025-03-03 15:39:09,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:39:09,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:39:09,918 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:39:09,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:39:09 BoogieIcfgContainer [2025-03-03 15:39:09,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:39:09,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:39:09,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:39:09,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:39:09,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:39:00" (1/3) ... [2025-03-03 15:39:09,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366a53b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:39:09, skipping insertion in model container [2025-03-03 15:39:09,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:02" (2/3) ... [2025-03-03 15:39:09,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366a53b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:39:09, skipping insertion in model container [2025-03-03 15:39:09,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:39:09" (3/3) ... [2025-03-03 15:39:09,929 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.12.cil-2.c [2025-03-03 15:39:09,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:39:09,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.12.cil-2.c that has 7 procedures, 2591 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-03 15:39:10,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:39:10,136 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;@3b74e5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:39:10,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:39:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 2591 states, 2556 states have (on average 1.828247261345853) internal successors, (4673), 2559 states have internal predecessors, (4673), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 15:39:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:10,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:10,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:10,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:10,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1913484464, now seen corresponding path program 1 times [2025-03-03 15:39:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:10,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928007521] [2025-03-03 15:39:10,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:10,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:10,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:10,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:10,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:10,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928007521] [2025-03-03 15:39:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928007521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806348400] [2025-03-03 15:39:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:10,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:10,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:10,908 INFO L87 Difference]: Start difference. First operand has 2591 states, 2556 states have (on average 1.828247261345853) internal successors, (4673), 2559 states have internal predecessors, (4673), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:11,701 INFO L93 Difference]: Finished difference Result 5596 states and 10117 transitions. [2025-03-03 15:39:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:39:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:11,728 INFO L225 Difference]: With dead ends: 5596 [2025-03-03 15:39:11,729 INFO L226 Difference]: Without dead ends: 2955 [2025-03-03 15:39:11,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:11,741 INFO L435 NwaCegarLoop]: 4516 mSDtfsCounter, 5202 mSDsluCounter, 9319 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 13835 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:11,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 13835 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2025-03-03 15:39:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2926. [2025-03-03 15:39:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2864 states have (on average 1.7838687150837989) internal successors, (5109), 2867 states have internal predecessors, (5109), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 15:39:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5204 transitions. [2025-03-03 15:39:11,916 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5204 transitions. Word has length 178 [2025-03-03 15:39:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5204 transitions. [2025-03-03 15:39:11,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5204 transitions. [2025-03-03 15:39:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:11,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:11,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:11,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:39:11,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:11,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash -203993454, now seen corresponding path program 1 times [2025-03-03 15:39:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883650935] [2025-03-03 15:39:11,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:11,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:11,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883650935] [2025-03-03 15:39:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883650935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7626115] [2025-03-03 15:39:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:12,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:12,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:12,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:12,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:12,149 INFO L87 Difference]: Start difference. First operand 2926 states and 5204 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:12,520 INFO L93 Difference]: Finished difference Result 3789 states and 6569 transitions. [2025-03-03 15:39:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:12,535 INFO L225 Difference]: With dead ends: 3789 [2025-03-03 15:39:12,536 INFO L226 Difference]: Without dead ends: 3004 [2025-03-03 15:39:12,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:12,541 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4797 mSDsluCounter, 8715 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4817 SdHoareTripleChecker+Valid, 13150 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:12,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4817 Valid, 13150 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2025-03-03 15:39:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2926. [2025-03-03 15:39:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2864 states have (on average 1.7831703910614525) internal successors, (5107), 2867 states have internal predecessors, (5107), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 15:39:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5202 transitions. [2025-03-03 15:39:12,691 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5202 transitions. Word has length 178 [2025-03-03 15:39:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:12,692 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5202 transitions. [2025-03-03 15:39:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5202 transitions. [2025-03-03 15:39:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:12,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:12,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:39:12,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -509627983, now seen corresponding path program 1 times [2025-03-03 15:39:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539854489] [2025-03-03 15:39:12,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:12,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:12,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:12,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:12,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:12,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539854489] [2025-03-03 15:39:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539854489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105278700] [2025-03-03 15:39:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:12,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:12,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:12,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:12,951 INFO L87 Difference]: Start difference. First operand 2926 states and 5202 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:13,630 INFO L93 Difference]: Finished difference Result 4214 states and 7228 transitions. [2025-03-03 15:39:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:13,647 INFO L225 Difference]: With dead ends: 4214 [2025-03-03 15:39:13,647 INFO L226 Difference]: Without dead ends: 3429 [2025-03-03 15:39:13,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:13,654 INFO L435 NwaCegarLoop]: 4529 mSDtfsCounter, 5166 mSDsluCounter, 13765 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5186 SdHoareTripleChecker+Valid, 18294 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:13,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5186 Valid, 18294 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:39:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2025-03-03 15:39:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3300. [2025-03-03 15:39:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3210 states have (on average 1.7545171339563863) internal successors, (5632), 3214 states have internal predecessors, (5632), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-03 15:39:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5772 transitions. [2025-03-03 15:39:13,747 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5772 transitions. Word has length 178 [2025-03-03 15:39:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:13,748 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5772 transitions. [2025-03-03 15:39:13,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5772 transitions. [2025-03-03 15:39:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:13,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:13,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:39:13,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1212223822, now seen corresponding path program 1 times [2025-03-03 15:39:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107446656] [2025-03-03 15:39:13,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:13,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:13,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:13,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107446656] [2025-03-03 15:39:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107446656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:13,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:13,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959334234] [2025-03-03 15:39:13,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:13,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:13,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:13,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:13,925 INFO L87 Difference]: Start difference. First operand 3300 states and 5772 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:14,777 INFO L93 Difference]: Finished difference Result 5403 states and 9071 transitions. [2025-03-03 15:39:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:14,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:14,795 INFO L225 Difference]: With dead ends: 5403 [2025-03-03 15:39:14,795 INFO L226 Difference]: Without dead ends: 4244 [2025-03-03 15:39:14,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:14,801 INFO L435 NwaCegarLoop]: 4780 mSDtfsCounter, 5132 mSDsluCounter, 14423 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5152 SdHoareTripleChecker+Valid, 19203 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:14,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5152 Valid, 19203 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:39:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2025-03-03 15:39:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 4095. [2025-03-03 15:39:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 3947 states have (on average 1.7149733975171015) internal successors, (6769), 3955 states have internal predecessors, (6769), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-03 15:39:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 7005 transitions. [2025-03-03 15:39:14,927 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 7005 transitions. Word has length 178 [2025-03-03 15:39:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:14,927 INFO L471 AbstractCegarLoop]: Abstraction has 4095 states and 7005 transitions. [2025-03-03 15:39:14,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 7005 transitions. [2025-03-03 15:39:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:14,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:14,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:39:14,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -265056879, now seen corresponding path program 1 times [2025-03-03 15:39:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804322572] [2025-03-03 15:39:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:14,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:14,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:14,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:14,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804322572] [2025-03-03 15:39:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804322572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:15,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:15,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363906196] [2025-03-03 15:39:15,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:15,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:15,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:15,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:15,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:15,096 INFO L87 Difference]: Start difference. First operand 4095 states and 7005 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:15,816 INFO L93 Difference]: Finished difference Result 7964 states and 13126 transitions. [2025-03-03 15:39:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:15,842 INFO L225 Difference]: With dead ends: 7964 [2025-03-03 15:39:15,842 INFO L226 Difference]: Without dead ends: 6010 [2025-03-03 15:39:15,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:15,851 INFO L435 NwaCegarLoop]: 4777 mSDtfsCounter, 5127 mSDsluCounter, 14414 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5147 SdHoareTripleChecker+Valid, 19191 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:15,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5147 Valid, 19191 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2025-03-03 15:39:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 5820. [2025-03-03 15:39:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5820 states, 5550 states have (on average 1.6744144144144144) internal successors, (9293), 5572 states have internal predecessors, (9293), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-03 15:39:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5820 states to 5820 states and 9745 transitions. [2025-03-03 15:39:16,132 INFO L78 Accepts]: Start accepts. Automaton has 5820 states and 9745 transitions. Word has length 178 [2025-03-03 15:39:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:16,134 INFO L471 AbstractCegarLoop]: Abstraction has 5820 states and 9745 transitions. [2025-03-03 15:39:16,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5820 states and 9745 transitions. [2025-03-03 15:39:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:16,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:16,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:16,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:39:16,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:16,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 458233554, now seen corresponding path program 1 times [2025-03-03 15:39:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150668050] [2025-03-03 15:39:16,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:16,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:16,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150668050] [2025-03-03 15:39:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150668050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57915876] [2025-03-03 15:39:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:16,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:16,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:16,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:16,294 INFO L87 Difference]: Start difference. First operand 5820 states and 9745 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:17,074 INFO L93 Difference]: Finished difference Result 13607 states and 22320 transitions. [2025-03-03 15:39:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:17,122 INFO L225 Difference]: With dead ends: 13607 [2025-03-03 15:39:17,122 INFO L226 Difference]: Without dead ends: 9928 [2025-03-03 15:39:17,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:17,136 INFO L435 NwaCegarLoop]: 4774 mSDtfsCounter, 5122 mSDsluCounter, 14405 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5142 SdHoareTripleChecker+Valid, 19179 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:17,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5142 Valid, 19179 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2025-03-03 15:39:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 9657. [2025-03-03 15:39:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9657 states, 9125 states have (on average 1.650082191780822) internal successors, (15057), 9193 states have internal predecessors, (15057), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-03 15:39:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 16037 transitions. [2025-03-03 15:39:17,470 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 16037 transitions. Word has length 178 [2025-03-03 15:39:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:17,471 INFO L471 AbstractCegarLoop]: Abstraction has 9657 states and 16037 transitions. [2025-03-03 15:39:17,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 16037 transitions. [2025-03-03 15:39:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:17,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:17,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:39:17,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:17,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2144133489, now seen corresponding path program 1 times [2025-03-03 15:39:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983001884] [2025-03-03 15:39:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:17,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:17,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:17,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:17,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983001884] [2025-03-03 15:39:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983001884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203962505] [2025-03-03 15:39:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:17,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:17,612 INFO L87 Difference]: Start difference. First operand 9657 states and 16037 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:18,627 INFO L93 Difference]: Finished difference Result 26382 states and 43938 transitions. [2025-03-03 15:39:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:18,764 INFO L225 Difference]: With dead ends: 26382 [2025-03-03 15:39:18,765 INFO L226 Difference]: Without dead ends: 18866 [2025-03-03 15:39:18,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:18,812 INFO L435 NwaCegarLoop]: 4771 mSDtfsCounter, 5117 mSDsluCounter, 14396 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 19167 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:18,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 19167 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18866 states. [2025-03-03 15:39:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18866 to 18438. [2025-03-03 15:39:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6521814404432134) internal successors, (28629), 17542 states have internal predecessors, (28629), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:39:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 31049 transitions. [2025-03-03 15:39:19,480 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 31049 transitions. Word has length 178 [2025-03-03 15:39:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:19,481 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 31049 transitions. [2025-03-03 15:39:19,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 31049 transitions. [2025-03-03 15:39:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:19,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:19,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:39:19,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1957902606, now seen corresponding path program 1 times [2025-03-03 15:39:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231732978] [2025-03-03 15:39:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:19,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:19,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:19,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:19,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:19,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231732978] [2025-03-03 15:39:19,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231732978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:19,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:19,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:19,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710649917] [2025-03-03 15:39:19,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:19,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:19,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:19,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:19,597 INFO L87 Difference]: Start difference. First operand 18438 states and 31049 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:20,328 INFO L93 Difference]: Finished difference Result 39635 states and 68262 transitions. [2025-03-03 15:39:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:20,411 INFO L225 Difference]: With dead ends: 39635 [2025-03-03 15:39:20,412 INFO L226 Difference]: Without dead ends: 23338 [2025-03-03 15:39:20,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:20,463 INFO L435 NwaCegarLoop]: 4422 mSDtfsCounter, 4789 mSDsluCounter, 8690 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 13112 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:20,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 13112 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23338 states. [2025-03-03 15:39:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23338 to 18438. [2025-03-03 15:39:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6502770083102494) internal successors, (28596), 17542 states have internal predecessors, (28596), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:39:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 31016 transitions. [2025-03-03 15:39:21,246 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 31016 transitions. Word has length 178 [2025-03-03 15:39:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:21,247 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 31016 transitions. [2025-03-03 15:39:21,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 31016 transitions. [2025-03-03 15:39:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:21,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:21,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:21,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:39:21,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:21,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2090226351, now seen corresponding path program 1 times [2025-03-03 15:39:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445785001] [2025-03-03 15:39:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:21,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:21,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:21,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:21,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445785001] [2025-03-03 15:39:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445785001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11359932] [2025-03-03 15:39:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:21,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:21,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:21,367 INFO L87 Difference]: Start difference. First operand 18438 states and 31016 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:22,013 INFO L93 Difference]: Finished difference Result 39390 states and 67706 transitions. [2025-03-03 15:39:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:22,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:22,083 INFO L225 Difference]: With dead ends: 39390 [2025-03-03 15:39:22,084 INFO L226 Difference]: Without dead ends: 23093 [2025-03-03 15:39:22,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:22,120 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4786 mSDsluCounter, 8685 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4806 SdHoareTripleChecker+Valid, 13104 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:22,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4806 Valid, 13104 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23093 states. [2025-03-03 15:39:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23093 to 18438. [2025-03-03 15:39:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6483725761772854) internal successors, (28563), 17542 states have internal predecessors, (28563), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:39:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 30983 transitions. [2025-03-03 15:39:22,709 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 30983 transitions. Word has length 178 [2025-03-03 15:39:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:22,709 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 30983 transitions. [2025-03-03 15:39:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 30983 transitions. [2025-03-03 15:39:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:22,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:22,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:22,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:39:22,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:22,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1124663534, now seen corresponding path program 1 times [2025-03-03 15:39:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:22,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570973605] [2025-03-03 15:39:22,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:22,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:22,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:22,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:22,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570973605] [2025-03-03 15:39:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570973605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659119882] [2025-03-03 15:39:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:22,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:22,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:22,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:22,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:22,844 INFO L87 Difference]: Start difference. First operand 18438 states and 30983 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:24,068 INFO L93 Difference]: Finished difference Result 55629 states and 95618 transitions. [2025-03-03 15:39:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:24,184 INFO L225 Difference]: With dead ends: 55629 [2025-03-03 15:39:24,184 INFO L226 Difference]: Without dead ends: 39332 [2025-03-03 15:39:24,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:24,222 INFO L435 NwaCegarLoop]: 4758 mSDtfsCounter, 5096 mSDsluCounter, 14359 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 19117 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:24,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 19117 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39332 states. [2025-03-03 15:39:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39332 to 38673. [2025-03-03 15:39:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6688370809766864) internal successors, (60487), 36913 states have internal predecessors, (60487), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:39:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67323 transitions. [2025-03-03 15:39:25,552 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67323 transitions. Word has length 178 [2025-03-03 15:39:25,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:25,553 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67323 transitions. [2025-03-03 15:39:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67323 transitions. [2025-03-03 15:39:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:25,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:25,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:25,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:39:25,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:25,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1786253007, now seen corresponding path program 1 times [2025-03-03 15:39:25,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:25,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130578788] [2025-03-03 15:39:25,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:25,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:25,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:25,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:25,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130578788] [2025-03-03 15:39:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130578788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924349287] [2025-03-03 15:39:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:25,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:25,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:25,694 INFO L87 Difference]: Start difference. First operand 38673 states and 67323 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:27,079 INFO L93 Difference]: Finished difference Result 87632 states and 157542 transitions. [2025-03-03 15:39:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:27,391 INFO L225 Difference]: With dead ends: 87632 [2025-03-03 15:39:27,391 INFO L226 Difference]: Without dead ends: 51100 [2025-03-03 15:39:27,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:27,450 INFO L435 NwaCegarLoop]: 4381 mSDtfsCounter, 4813 mSDsluCounter, 8643 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:27,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 13024 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51100 states. [2025-03-03 15:39:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51100 to 38673. [2025-03-03 15:39:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6670437301696786) internal successors, (60422), 36913 states have internal predecessors, (60422), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:39:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67258 transitions. [2025-03-03 15:39:28,911 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67258 transitions. Word has length 178 [2025-03-03 15:39:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:28,913 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67258 transitions. [2025-03-03 15:39:28,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67258 transitions. [2025-03-03 15:39:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:28,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:28,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:28,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:39:28,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash -837763278, now seen corresponding path program 1 times [2025-03-03 15:39:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:28,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822819147] [2025-03-03 15:39:28,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:28,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:28,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:29,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822819147] [2025-03-03 15:39:29,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822819147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:29,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:29,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449487262] [2025-03-03 15:39:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:29,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:29,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:29,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:29,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:29,016 INFO L87 Difference]: Start difference. First operand 38673 states and 67258 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:30,619 INFO L93 Difference]: Finished difference Result 86901 states and 155950 transitions. [2025-03-03 15:39:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:30,975 INFO L225 Difference]: With dead ends: 86901 [2025-03-03 15:39:30,975 INFO L226 Difference]: Without dead ends: 50369 [2025-03-03 15:39:31,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:31,025 INFO L435 NwaCegarLoop]: 4411 mSDtfsCounter, 4779 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4799 SdHoareTripleChecker+Valid, 13082 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:31,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4799 Valid, 13082 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50369 states. [2025-03-03 15:39:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50369 to 38673. [2025-03-03 15:39:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6652503793626707) internal successors, (60357), 36913 states have internal predecessors, (60357), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:39:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67193 transitions. [2025-03-03 15:39:32,408 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67193 transitions. Word has length 178 [2025-03-03 15:39:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:32,409 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67193 transitions. [2025-03-03 15:39:32,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67193 transitions. [2025-03-03 15:39:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:32,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:32,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:32,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:39:32,419 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:32,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -668619503, now seen corresponding path program 1 times [2025-03-03 15:39:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793245614] [2025-03-03 15:39:32,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:32,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:32,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793245614] [2025-03-03 15:39:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793245614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:32,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15344977] [2025-03-03 15:39:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:32,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:32,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:32,501 INFO L87 Difference]: Start difference. First operand 38673 states and 67193 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:34,081 INFO L93 Difference]: Finished difference Result 86170 states and 154358 transitions. [2025-03-03 15:39:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:34,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:34,262 INFO L225 Difference]: With dead ends: 86170 [2025-03-03 15:39:34,262 INFO L226 Difference]: Without dead ends: 49638 [2025-03-03 15:39:34,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:34,362 INFO L435 NwaCegarLoop]: 4408 mSDtfsCounter, 4776 mSDsluCounter, 8666 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 13074 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:34,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 13074 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:39:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2025-03-03 15:39:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 38673. [2025-03-03 15:39:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.663457028555663) internal successors, (60292), 36913 states have internal predecessors, (60292), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:39:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67128 transitions. [2025-03-03 15:39:36,315 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67128 transitions. Word has length 178 [2025-03-03 15:39:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:36,315 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67128 transitions. [2025-03-03 15:39:36,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67128 transitions. [2025-03-03 15:39:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:36,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:36,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:39:36,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1692141394, now seen corresponding path program 1 times [2025-03-03 15:39:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924789527] [2025-03-03 15:39:36,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:36,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:36,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924789527] [2025-03-03 15:39:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924789527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:36,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:36,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:36,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301185988] [2025-03-03 15:39:36,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:36,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:36,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:36,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:36,411 INFO L87 Difference]: Start difference. First operand 38673 states and 67128 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:38,796 INFO L93 Difference]: Finished difference Result 128170 states and 229756 transitions. [2025-03-03 15:39:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:39,075 INFO L225 Difference]: With dead ends: 128170 [2025-03-03 15:39:39,075 INFO L226 Difference]: Without dead ends: 91638 [2025-03-03 15:39:39,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:39,308 INFO L435 NwaCegarLoop]: 4738 mSDtfsCounter, 5441 mSDsluCounter, 14297 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 19035 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:39,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 19035 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:39:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91638 states. [2025-03-03 15:39:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91638 to 84783. [2025-03-03 15:39:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84783 states, 79297 states have (on average 1.6897738880411617) internal successors, (133994), 81359 states have internal predecessors, (133994), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-03 15:39:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84783 states to 84783 states and 155678 transitions. [2025-03-03 15:39:42,634 INFO L78 Accepts]: Start accepts. Automaton has 84783 states and 155678 transitions. Word has length 178 [2025-03-03 15:39:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:42,634 INFO L471 AbstractCegarLoop]: Abstraction has 84783 states and 155678 transitions. [2025-03-03 15:39:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84783 states and 155678 transitions. [2025-03-03 15:39:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:42,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:42,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:42,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:39:42,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash -725557007, now seen corresponding path program 1 times [2025-03-03 15:39:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724557757] [2025-03-03 15:39:42,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:42,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:42,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:42,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724557757] [2025-03-03 15:39:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724557757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:42,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:42,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:42,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232179405] [2025-03-03 15:39:42,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:42,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:42,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:42,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:42,720 INFO L87 Difference]: Start difference. First operand 84783 states and 155678 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:46,488 INFO L93 Difference]: Finished difference Result 195882 states and 374354 transitions. [2025-03-03 15:39:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:46,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:39:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:46,912 INFO L225 Difference]: With dead ends: 195882 [2025-03-03 15:39:46,913 INFO L226 Difference]: Without dead ends: 113240 [2025-03-03 15:39:47,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:47,118 INFO L435 NwaCegarLoop]: 4403 mSDtfsCounter, 4770 mSDsluCounter, 8655 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:47,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 13058 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:39:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113240 states. [2025-03-03 15:39:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113240 to 84783. [2025-03-03 15:39:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84783 states, 79297 states have (on average 1.6881470925760118) internal successors, (133865), 81359 states have internal predecessors, (133865), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-03 15:39:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84783 states to 84783 states and 155549 transitions. [2025-03-03 15:39:50,683 INFO L78 Accepts]: Start accepts. Automaton has 84783 states and 155549 transitions. Word has length 178 [2025-03-03 15:39:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 84783 states and 155549 transitions. [2025-03-03 15:39:50,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 84783 states and 155549 transitions. [2025-03-03 15:39:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:39:50,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:50,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:50,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:39:50,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -803547278, now seen corresponding path program 1 times [2025-03-03 15:39:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:50,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545745020] [2025-03-03 15:39:50,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:50,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:39:50,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:39:50,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:50,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:50,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:50,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545745020] [2025-03-03 15:39:50,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545745020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:50,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:50,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952626897] [2025-03-03 15:39:50,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:50,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:50,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:50,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:50,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:50,791 INFO L87 Difference]: Start difference. First operand 84783 states and 155549 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)