./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7640909f7ef47a12c6daa58dacf29a693ba9f7401fa2c48138a16311fc07e97d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:22:59,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:22:59,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:22:59,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:22:59,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:22:59,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:22:59,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:22:59,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:22:59,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:22:59,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:22:59,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:22:59,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:22:59,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:22:59,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:22:59,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:22:59,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:22:59,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:22:59,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:22:59,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:22:59,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:22:59,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:22:59,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:22:59,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:22:59,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:22:59,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:22:59,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:22:59,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:22:59,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7640909f7ef47a12c6daa58dacf29a693ba9f7401fa2c48138a16311fc07e97d [2025-01-09 05:22:59,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:22:59,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:22:59,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:22:59,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:22:59,808 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:22:59,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c [2025-01-09 05:23:01,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4648e1866/d6a1fb40ce4c4e3a9677477b94271ab9/FLAG3574212c3 [2025-01-09 05:23:01,996 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:23:01,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c [2025-01-09 05:23:02,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4648e1866/d6a1fb40ce4c4e3a9677477b94271ab9/FLAG3574212c3 [2025-01-09 05:23:02,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4648e1866/d6a1fb40ce4c4e3a9677477b94271ab9 [2025-01-09 05:23:02,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:23:02,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:23:02,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:23:02,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:23:02,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:23:02,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:23:02" (1/1) ... [2025-01-09 05:23:02,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e570f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:02, skipping insertion in model container [2025-01-09 05:23:02,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:23:02" (1/1) ... [2025-01-09 05:23:02,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:23:03,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c[382357,382370] [2025-01-09 05:23:03,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c[383339,383352] [2025-01-09 05:23:03,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:23:03,980 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:23:04,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c[382357,382370] [2025-01-09 05:23:04,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c[383339,383352] [2025-01-09 05:23:04,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:23:04,775 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:23:04,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04 WrapperNode [2025-01-09 05:23:04,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:23:04,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:23:04,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:23:04,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:23:04,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:04,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,316 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12735 [2025-01-09 05:23:05,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:23:05,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:23:05,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:23:05,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:23:05,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,616 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-01-09 05:23:05,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:05,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:06,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:23:06,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:23:06,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:23:06,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:23:06,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (1/1) ... [2025-01-09 05:23:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:06,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:06,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:23:06,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:23:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:23:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:23:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:23:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:23:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:23:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:23:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:23:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:23:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:23:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:23:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:23:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:23:06,171 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:23:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:23:06,171 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:23:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:23:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:23:06,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:23:06,291 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:23:06,294 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:23:14,568 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2025-01-09 05:23:14,568 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:23:14,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:23:14,640 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 05:23:14,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:23:14 BoogieIcfgContainer [2025-01-09 05:23:14,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:23:14,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:23:14,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:23:14,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:23:14,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:23:02" (1/3) ... [2025-01-09 05:23:14,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6413870d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:23:14, skipping insertion in model container [2025-01-09 05:23:14,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:04" (2/3) ... [2025-01-09 05:23:14,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6413870d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:23:14, skipping insertion in model container [2025-01-09 05:23:14,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:23:14" (3/3) ... [2025-01-09 05:23:14,656 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.04.cil-2.c [2025-01-09 05:23:14,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:23:14,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.04.cil-2.c that has 8 procedures, 2371 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-01-09 05:23:14,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:23:14,798 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;@77bd7c39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:23:14,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:23:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 2371 states, 2342 states have (on average 1.8509820666097352) internal successors, (4335), 2346 states have internal predecessors, (4335), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 05:23:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:14,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:14,827 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] [2025-01-09 05:23:14,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:14,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -175604625, now seen corresponding path program 1 times [2025-01-09 05:23:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896264487] [2025-01-09 05:23:14,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:14,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:14,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:14,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:15,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896264487] [2025-01-09 05:23:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896264487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:15,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:23:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652490937] [2025-01-09 05:23:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:15,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:15,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:15,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:23:15,219 INFO L87 Difference]: Start difference. First operand has 2371 states, 2342 states have (on average 1.8509820666097352) internal successors, (4335), 2346 states have internal predecessors, (4335), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:15,434 INFO L93 Difference]: Finished difference Result 4734 states and 8737 transitions. [2025-01-09 05:23:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:23:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:15,465 INFO L225 Difference]: With dead ends: 4734 [2025-01-09 05:23:15,466 INFO L226 Difference]: Without dead ends: 2303 [2025-01-09 05:23:15,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:23:15,480 INFO L435 NwaCegarLoop]: 4302 mSDtfsCounter, 274 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 8324 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:15,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 8324 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:23:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2025-01-09 05:23:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2303. [2025-01-09 05:23:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2275 states have (on average 1.8443956043956045) internal successors, (4196), 2278 states have internal predecessors, (4196), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 05:23:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4234 transitions. [2025-01-09 05:23:15,637 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4234 transitions. Word has length 89 [2025-01-09 05:23:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:15,638 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4234 transitions. [2025-01-09 05:23:15,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4234 transitions. [2025-01-09 05:23:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:15,645 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] [2025-01-09 05:23:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:23:15,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash -415844371, now seen corresponding path program 1 times [2025-01-09 05:23:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033603241] [2025-01-09 05:23:15,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:15,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:15,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:15,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:15,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033603241] [2025-01-09 05:23:15,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033603241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:15,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:15,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:23:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121376013] [2025-01-09 05:23:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:15,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:23:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:15,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:23:15,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:23:15,936 INFO L87 Difference]: Start difference. First operand 2303 states and 4234 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:16,442 INFO L93 Difference]: Finished difference Result 2659 states and 4784 transitions. [2025-01-09 05:23:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:23:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:16,460 INFO L225 Difference]: With dead ends: 2659 [2025-01-09 05:23:16,460 INFO L226 Difference]: Without dead ends: 2489 [2025-01-09 05:23:16,463 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-01-09 05:23:16,464 INFO L435 NwaCegarLoop]: 4172 mSDtfsCounter, 4440 mSDsluCounter, 8445 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4452 SdHoareTripleChecker+Valid, 12617 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:16,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4452 Valid, 12617 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-01-09 05:23:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2474. [2025-01-09 05:23:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2426 states have (on average 1.8268755152514426) internal successors, (4432), 2430 states have internal predecessors, (4432), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-01-09 05:23:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4497 transitions. [2025-01-09 05:23:16,625 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4497 transitions. Word has length 89 [2025-01-09 05:23:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:16,625 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4497 transitions. [2025-01-09 05:23:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4497 transitions. [2025-01-09 05:23:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:16,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:16,629 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] [2025-01-09 05:23:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:23:16,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:16,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -38094615, now seen corresponding path program 1 times [2025-01-09 05:23:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641008738] [2025-01-09 05:23:16,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:16,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:16,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:16,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:16,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:16,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641008738] [2025-01-09 05:23:16,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641008738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:16,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747436369] [2025-01-09 05:23:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:16,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:16,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:16,893 INFO L87 Difference]: Start difference. First operand 2474 states and 4497 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:17,524 INFO L93 Difference]: Finished difference Result 3030 states and 5359 transitions. [2025-01-09 05:23:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:17,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:17,542 INFO L225 Difference]: With dead ends: 3030 [2025-01-09 05:23:17,542 INFO L226 Difference]: Without dead ends: 2689 [2025-01-09 05:23:17,545 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-01-09 05:23:17,546 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4433 mSDsluCounter, 12923 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 17237 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:17,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 17237 Invalid, 595 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2025-01-09 05:23:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2634. [2025-01-09 05:23:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2566 states have (on average 1.8106001558846454) internal successors, (4646), 2571 states have internal predecessors, (4646), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-01-09 05:23:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 4740 transitions. [2025-01-09 05:23:17,643 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 4740 transitions. Word has length 89 [2025-01-09 05:23:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:17,645 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 4740 transitions. [2025-01-09 05:23:17,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 4740 transitions. [2025-01-09 05:23:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:17,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:17,647 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] [2025-01-09 05:23:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:23:17,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:17,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1949137173, now seen corresponding path program 1 times [2025-01-09 05:23:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:17,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006495003] [2025-01-09 05:23:17,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:17,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:17,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:17,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:17,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:17,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006495003] [2025-01-09 05:23:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006495003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087823334] [2025-01-09 05:23:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:17,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:17,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:17,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:17,833 INFO L87 Difference]: Start difference. First operand 2634 states and 4740 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:18,393 INFO L93 Difference]: Finished difference Result 3532 states and 6131 transitions. [2025-01-09 05:23:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:18,413 INFO L225 Difference]: With dead ends: 3532 [2025-01-09 05:23:18,414 INFO L226 Difference]: Without dead ends: 3031 [2025-01-09 05:23:18,418 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-01-09 05:23:18,420 INFO L435 NwaCegarLoop]: 4182 mSDtfsCounter, 4445 mSDsluCounter, 12618 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 16800 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:18,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4457 Valid, 16800 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2025-01-09 05:23:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2971. [2025-01-09 05:23:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2861 states have (on average 1.7829430269136666) internal successors, (5101), 2870 states have internal predecessors, (5101), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-01-09 05:23:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 5259 transitions. [2025-01-09 05:23:18,531 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 5259 transitions. Word has length 89 [2025-01-09 05:23:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:18,531 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 5259 transitions. [2025-01-09 05:23:18,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 5259 transitions. [2025-01-09 05:23:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:18,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:18,534 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] [2025-01-09 05:23:18,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:23:18,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:18,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1872236375, now seen corresponding path program 1 times [2025-01-09 05:23:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681113325] [2025-01-09 05:23:18,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:18,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:18,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:18,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:18,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681113325] [2025-01-09 05:23:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681113325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:18,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:18,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846077126] [2025-01-09 05:23:18,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:18,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:18,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:18,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:18,680 INFO L87 Difference]: Start difference. First operand 2971 states and 5259 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:19,211 INFO L93 Difference]: Finished difference Result 4599 states and 7804 transitions. [2025-01-09 05:23:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:19,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:19,232 INFO L225 Difference]: With dead ends: 4599 [2025-01-09 05:23:19,233 INFO L226 Difference]: Without dead ends: 3761 [2025-01-09 05:23:19,238 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-01-09 05:23:19,239 INFO L435 NwaCegarLoop]: 4307 mSDtfsCounter, 4423 mSDsluCounter, 12902 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4435 SdHoareTripleChecker+Valid, 17209 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:19,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4435 Valid, 17209 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2025-01-09 05:23:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3690. [2025-01-09 05:23:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3490 states have (on average 1.742406876790831) internal successors, (6081), 3513 states have internal predecessors, (6081), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-01-09 05:23:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 6391 transitions. [2025-01-09 05:23:19,467 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 6391 transitions. Word has length 89 [2025-01-09 05:23:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:19,468 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 6391 transitions. [2025-01-09 05:23:19,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 6391 transitions. [2025-01-09 05:23:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:19,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:19,470 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] [2025-01-09 05:23:19,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:23:19,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1455380267, now seen corresponding path program 1 times [2025-01-09 05:23:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773733408] [2025-01-09 05:23:19,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:19,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:19,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:19,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:19,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:19,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773733408] [2025-01-09 05:23:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773733408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370975093] [2025-01-09 05:23:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:19,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:19,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:19,609 INFO L87 Difference]: Start difference. First operand 3690 states and 6391 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:20,230 INFO L93 Difference]: Finished difference Result 7120 states and 11831 transitions. [2025-01-09 05:23:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:20,264 INFO L225 Difference]: With dead ends: 7120 [2025-01-09 05:23:20,265 INFO L226 Difference]: Without dead ends: 5563 [2025-01-09 05:23:20,274 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-01-09 05:23:20,276 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4549 mSDsluCounter, 12872 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4566 SdHoareTripleChecker+Valid, 17170 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:20,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4566 Valid, 17170 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2025-01-09 05:23:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 5194. [2025-01-09 05:23:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 4804 states have (on average 1.6958784346378017) internal successors, (8147), 4873 states have internal predecessors, (8147), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-01-09 05:23:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 8841 transitions. [2025-01-09 05:23:20,552 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 8841 transitions. Word has length 89 [2025-01-09 05:23:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:20,552 INFO L471 AbstractCegarLoop]: Abstraction has 5194 states and 8841 transitions. [2025-01-09 05:23:20,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 8841 transitions. [2025-01-09 05:23:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:20,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:20,559 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] [2025-01-09 05:23:20,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:23:20,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:20,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash 962754093, now seen corresponding path program 1 times [2025-01-09 05:23:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996462678] [2025-01-09 05:23:20,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:20,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:20,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:20,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:20,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996462678] [2025-01-09 05:23:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996462678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:20,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:20,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193881389] [2025-01-09 05:23:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:20,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:20,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:20,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:20,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:20,690 INFO L87 Difference]: Start difference. First operand 5194 states and 8841 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:21,510 INFO L93 Difference]: Finished difference Result 12040 states and 20147 transitions. [2025-01-09 05:23:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:21,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:21,576 INFO L225 Difference]: With dead ends: 12040 [2025-01-09 05:23:21,576 INFO L226 Difference]: Without dead ends: 8979 [2025-01-09 05:23:21,592 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-01-09 05:23:21,593 INFO L435 NwaCegarLoop]: 4294 mSDtfsCounter, 4442 mSDsluCounter, 12860 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 17154 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:21,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 17154 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:23:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8979 states. [2025-01-09 05:23:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8979 to 8277. [2025-01-09 05:23:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 7461 states have (on average 1.6495107894384131) internal successors, (12307), 7676 states have internal predecessors, (12307), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-01-09 05:23:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 14137 transitions. [2025-01-09 05:23:22,022 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 14137 transitions. Word has length 89 [2025-01-09 05:23:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:22,024 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 14137 transitions. [2025-01-09 05:23:22,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 14137 transitions. [2025-01-09 05:23:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:22,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:22,032 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] [2025-01-09 05:23:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:23:22,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1916694251, now seen corresponding path program 1 times [2025-01-09 05:23:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581243042] [2025-01-09 05:23:22,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:22,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581243042] [2025-01-09 05:23:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581243042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793004125] [2025-01-09 05:23:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:22,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:22,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:22,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:22,147 INFO L87 Difference]: Start difference. First operand 8277 states and 14137 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:23,515 INFO L93 Difference]: Finished difference Result 22109 states and 38589 transitions. [2025-01-09 05:23:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:23,591 INFO L225 Difference]: With dead ends: 22109 [2025-01-09 05:23:23,591 INFO L226 Difference]: Without dead ends: 15965 [2025-01-09 05:23:23,618 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-01-09 05:23:23,619 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4479 mSDsluCounter, 12854 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 17146 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:23,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 17146 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:23:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15965 states. [2025-01-09 05:23:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15965 to 15106. [2025-01-09 05:23:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15106 states, 13292 states have (on average 1.617439061089377) internal successors, (21499), 13961 states have internal predecessors, (21499), 756 states have call successors, (756), 391 states have call predecessors, (756), 1056 states have return successors, (4850), 817 states have call predecessors, (4850), 754 states have call successors, (4850) [2025-01-09 05:23:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15106 states to 15106 states and 27105 transitions. [2025-01-09 05:23:24,732 INFO L78 Accepts]: Start accepts. Automaton has 15106 states and 27105 transitions. Word has length 89 [2025-01-09 05:23:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:24,732 INFO L471 AbstractCegarLoop]: Abstraction has 15106 states and 27105 transitions. [2025-01-09 05:23:24,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15106 states and 27105 transitions. [2025-01-09 05:23:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:24,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:24,746 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] [2025-01-09 05:23:24,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:23:24,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:24,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 700540525, now seen corresponding path program 1 times [2025-01-09 05:23:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951410340] [2025-01-09 05:23:24,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:24,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:24,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:24,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:24,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-01-09 05:23:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951410340] [2025-01-09 05:23:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951410340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726857855] [2025-01-09 05:23:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:24,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:24,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:24,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:24,881 INFO L87 Difference]: Start difference. First operand 15106 states and 27105 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:26,537 INFO L93 Difference]: Finished difference Result 44032 states and 84923 transitions. [2025-01-09 05:23:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:26,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:26,722 INFO L225 Difference]: With dead ends: 44032 [2025-01-09 05:23:26,722 INFO L226 Difference]: Without dead ends: 31059 [2025-01-09 05:23:26,773 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-01-09 05:23:26,774 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4444 mSDsluCounter, 12845 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4461 SdHoareTripleChecker+Valid, 17134 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:26,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4461 Valid, 17134 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31059 states. [2025-01-09 05:23:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31059 to 29883. [2025-01-09 05:23:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29883 states, 25619 states have (on average 1.590967641203794) internal successors, (40759), 27682 states have internal predecessors, (40759), 1428 states have call successors, (1428), 775 states have call predecessors, (1428), 2834 states have return successors, (17810), 1553 states have call predecessors, (17810), 1426 states have call successors, (17810) [2025-01-09 05:23:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29883 states to 29883 states and 59997 transitions. [2025-01-09 05:23:28,890 INFO L78 Accepts]: Start accepts. Automaton has 29883 states and 59997 transitions. Word has length 89 [2025-01-09 05:23:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:28,890 INFO L471 AbstractCegarLoop]: Abstraction has 29883 states and 59997 transitions. [2025-01-09 05:23:28,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29883 states and 59997 transitions. [2025-01-09 05:23:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:28,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:28,910 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] [2025-01-09 05:23:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:23:28,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash -31426901, now seen corresponding path program 1 times [2025-01-09 05:23:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214482190] [2025-01-09 05:23:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:28,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:28,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:28,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:28,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214482190] [2025-01-09 05:23:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214482190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245630318] [2025-01-09 05:23:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:29,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:29,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:29,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:29,024 INFO L87 Difference]: Start difference. First operand 29883 states and 59997 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:32,027 INFO L93 Difference]: Finished difference Result 90443 states and 207969 transitions. [2025-01-09 05:23:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:32,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:32,568 INFO L225 Difference]: With dead ends: 90443 [2025-01-09 05:23:32,568 INFO L226 Difference]: Without dead ends: 62693 [2025-01-09 05:23:32,685 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-01-09 05:23:32,686 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4398 mSDsluCounter, 12838 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 17122 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:32,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4409 Valid, 17122 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62693 states. [2025-01-09 05:23:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62693 to 61408. [2025-01-09 05:23:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61408 states, 50866 states have (on average 1.5546534030590178) internal successors, (79079), 57175 states have internal predecessors, (79079), 2700 states have call successors, (2700), 1535 states have call predecessors, (2700), 7840 states have return successors, (68234), 2953 states have call predecessors, (68234), 2698 states have call successors, (68234) [2025-01-09 05:23:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61408 states to 61408 states and 150013 transitions. [2025-01-09 05:23:38,793 INFO L78 Accepts]: Start accepts. Automaton has 61408 states and 150013 transitions. Word has length 89 [2025-01-09 05:23:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:38,794 INFO L471 AbstractCegarLoop]: Abstraction has 61408 states and 150013 transitions. [2025-01-09 05:23:38,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 61408 states and 150013 transitions. [2025-01-09 05:23:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:23:38,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:38,858 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] [2025-01-09 05:23:38,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:23:38,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1717606739, now seen corresponding path program 1 times [2025-01-09 05:23:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885075268] [2025-01-09 05:23:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:38,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:23:38,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:23:38,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:38,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885075268] [2025-01-09 05:23:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885075268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:23:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586752364] [2025-01-09 05:23:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:38,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:23:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:38,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:23:38,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:23:38,921 INFO L87 Difference]: Start difference. First operand 61408 states and 150013 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:43,860 INFO L93 Difference]: Finished difference Result 153626 states and 374024 transitions. [2025-01-09 05:23:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:23:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 05:23:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:44,573 INFO L225 Difference]: With dead ends: 153626 [2025-01-09 05:23:44,573 INFO L226 Difference]: Without dead ends: 94352 [2025-01-09 05:23:44,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:23:44,971 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 4418 mSDsluCounter, 4389 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4418 SdHoareTripleChecker+Valid, 8847 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:44,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4418 Valid, 8847 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:23:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94352 states.