./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 695981a417316c4c07ccb52b1c4d12f1832a3ea99763b6fdb28c03b28d3203ad --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:08:14,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:08:14,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:08:14,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:08:14,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:08:14,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:08:14,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:08:14,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:08:14,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:08:14,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:08:14,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:08:14,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:08:14,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:08:14,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:08:14,359 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:08:14,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:08:14,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:08:14,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:08:14,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:08:14,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:08:14,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:08:14,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:08:14,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:08:14,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:08:14,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:08:14,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:08:14,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:08:14,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:08:14,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:08:14,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:08:14,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 695981a417316c4c07ccb52b1c4d12f1832a3ea99763b6fdb28c03b28d3203ad [2024-11-11 22:08:14,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:08:14,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:08:14,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:08:14,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:08:14,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:08:14,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c [2024-11-11 22:08:15,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:08:16,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:08:16,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c [2024-11-11 22:08:16,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daafb1b6b/222517770ed340a89c79e06fd6cb0fae/FLAG0574e1685 [2024-11-11 22:08:16,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daafb1b6b/222517770ed340a89c79e06fd6cb0fae [2024-11-11 22:08:16,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:08:16,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:08:16,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:08:16,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:08:16,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:08:16,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:08:16" (1/1) ... [2024-11-11 22:08:16,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d14735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:16, skipping insertion in model container [2024-11-11 22:08:16,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:08:16" (1/1) ... [2024-11-11 22:08:16,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:08:17,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[378560,378573] [2024-11-11 22:08:17,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[383339,383352] [2024-11-11 22:08:17,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:08:17,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:08:18,599 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[378560,378573] [2024-11-11 22:08:18,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[383339,383352] [2024-11-11 22:08:18,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:08:18,653 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:08:18,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18 WrapperNode [2024-11-11 22:08:18,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:08:18,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:08:18,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:08:18,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:08:18,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:18,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:18,960 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13059 [2024-11-11 22:08:18,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:08:18,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:08:18,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:08:18,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:08:18,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:18,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,088 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]. [2024-11-11 22:08:19,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:08:19,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:08:19,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:08:19,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:08:19,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:08:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:08:19,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:08:19,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:08:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:08:19,573 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:08:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:08:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:08:19,575 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:08:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:08:19,575 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:08:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:08:19,575 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:08:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:08:19,576 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:08:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:08:19,576 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:08:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:08:19,576 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:08:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:08:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:08:19,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:08:19,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:08:19,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:08:26,116 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2024-11-11 22:08:26,117 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:08:26,165 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:08:26,166 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-11 22:08:26,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:08:26 BoogieIcfgContainer [2024-11-11 22:08:26,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:08:26,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:08:26,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:08:26,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:08:26,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:08:16" (1/3) ... [2024-11-11 22:08:26,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662637b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:08:26, skipping insertion in model container [2024-11-11 22:08:26,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18" (2/3) ... [2024-11-11 22:08:26,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662637b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:08:26, skipping insertion in model container [2024-11-11 22:08:26,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:08:26" (3/3) ... [2024-11-11 22:08:26,174 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.09.cil-2.c [2024-11-11 22:08:26,187 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:08:26,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:08:26,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:08:26,323 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;@276c4ca3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:08:26,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:08:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-11 22:08:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:26,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:26,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:26,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 273379068, now seen corresponding path program 1 times [2024-11-11 22:08:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002360525] [2024-11-11 22:08:26,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:26,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002360525] [2024-11-11 22:08:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002360525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:08:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211510192] [2024-11-11 22:08:26,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:26,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:08:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:08:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:08:26,876 INFO L87 Difference]: Start difference. First operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:28,229 INFO L93 Difference]: Finished difference Result 5116 states and 9393 transitions. [2024-11-11 22:08:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:08:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:28,264 INFO L225 Difference]: With dead ends: 5116 [2024-11-11 22:08:28,265 INFO L226 Difference]: Without dead ends: 2549 [2024-11-11 22:08:28,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:08:28,280 INFO L435 NwaCegarLoop]: 4325 mSDtfsCounter, 835 mSDsluCounter, 12425 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:28,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 16750 Invalid, 860 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:08:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2024-11-11 22:08:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2440. [2024-11-11 22:08:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2407 states have (on average 1.8292480265891151) internal successors, (4403), 2410 states have internal predecessors, (4403), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-11 22:08:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4451 transitions. [2024-11-11 22:08:28,428 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4451 transitions. Word has length 146 [2024-11-11 22:08:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4451 transitions. [2024-11-11 22:08:28,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4451 transitions. [2024-11-11 22:08:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:28,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:28,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:28,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:08:28,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:28,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1125574534, now seen corresponding path program 1 times [2024-11-11 22:08:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781053762] [2024-11-11 22:08:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:28,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781053762] [2024-11-11 22:08:28,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781053762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:28,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:08:28,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917631216] [2024-11-11 22:08:28,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:28,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:08:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:08:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:08:28,743 INFO L87 Difference]: Start difference. First operand 2440 states and 4451 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:30,744 INFO L93 Difference]: Finished difference Result 3274 states and 5782 transitions. [2024-11-11 22:08:30,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:08:30,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:30,754 INFO L225 Difference]: With dead ends: 3274 [2024-11-11 22:08:30,755 INFO L226 Difference]: Without dead ends: 2972 [2024-11-11 22:08:30,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:08:30,757 INFO L435 NwaCegarLoop]: 4271 mSDtfsCounter, 5199 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 17057 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:30,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 17057 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:08:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-11 22:08:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2753. [2024-11-11 22:08:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2695 states have (on average 1.8018552875695732) internal successors, (4856), 2699 states have internal predecessors, (4856), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-11 22:08:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 4943 transitions. [2024-11-11 22:08:30,815 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 4943 transitions. Word has length 146 [2024-11-11 22:08:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:30,816 INFO L471 AbstractCegarLoop]: Abstraction has 2753 states and 4943 transitions. [2024-11-11 22:08:30,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 4943 transitions. [2024-11-11 22:08:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:30,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:30,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:08:30,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:30,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1367927158, now seen corresponding path program 1 times [2024-11-11 22:08:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:30,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839342105] [2024-11-11 22:08:30,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839342105] [2024-11-11 22:08:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839342105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:31,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800173719] [2024-11-11 22:08:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:31,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:31,065 INFO L87 Difference]: Start difference. First operand 2753 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:33,298 INFO L93 Difference]: Finished difference Result 4022 states and 6969 transitions. [2024-11-11 22:08:33,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:33,313 INFO L225 Difference]: With dead ends: 4022 [2024-11-11 22:08:33,313 INFO L226 Difference]: Without dead ends: 3407 [2024-11-11 22:08:33,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:33,317 INFO L435 NwaCegarLoop]: 4443 mSDtfsCounter, 5228 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5244 SdHoareTripleChecker+Valid, 21936 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:33,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5244 Valid, 21936 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:08:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-11-11 22:08:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3045. [2024-11-11 22:08:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 2962 states have (on average 1.7781904118838623) internal successors, (5267), 2967 states have internal predecessors, (5267), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-11 22:08:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 5392 transitions. [2024-11-11 22:08:33,430 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 5392 transitions. Word has length 146 [2024-11-11 22:08:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 5392 transitions. [2024-11-11 22:08:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 5392 transitions. [2024-11-11 22:08:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:33,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:33,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:33,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:08:33,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:33,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 661330552, now seen corresponding path program 1 times [2024-11-11 22:08:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:33,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702229970] [2024-11-11 22:08:33,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702229970] [2024-11-11 22:08:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702229970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:33,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422286376] [2024-11-11 22:08:33,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:33,632 INFO L87 Difference]: Start difference. First operand 3045 states and 5392 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:35,731 INFO L93 Difference]: Finished difference Result 5124 states and 8706 transitions. [2024-11-11 22:08:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:35,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:35,746 INFO L225 Difference]: With dead ends: 5124 [2024-11-11 22:08:35,746 INFO L226 Difference]: Without dead ends: 4217 [2024-11-11 22:08:35,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:35,750 INFO L435 NwaCegarLoop]: 4441 mSDtfsCounter, 5222 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5238 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:35,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5238 Valid, 21934 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:08:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2024-11-11 22:08:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3633. [2024-11-11 22:08:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3500 states have (on average 1.7417142857142858) internal successors, (6096), 3507 states have internal predecessors, (6096), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-11 22:08:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6301 transitions. [2024-11-11 22:08:35,849 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6301 transitions. Word has length 146 [2024-11-11 22:08:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:35,850 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 6301 transitions. [2024-11-11 22:08:35,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6301 transitions. [2024-11-11 22:08:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:35,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:35,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:35,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:08:35,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1523164154, now seen corresponding path program 1 times [2024-11-11 22:08:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:35,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453986801] [2024-11-11 22:08:35,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:36,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453986801] [2024-11-11 22:08:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453986801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610132652] [2024-11-11 22:08:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:36,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:36,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:36,090 INFO L87 Difference]: Start difference. First operand 3633 states and 6301 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:38,153 INFO L93 Difference]: Finished difference Result 7254 states and 12043 transitions. [2024-11-11 22:08:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:38,171 INFO L225 Difference]: With dead ends: 7254 [2024-11-11 22:08:38,171 INFO L226 Difference]: Without dead ends: 5759 [2024-11-11 22:08:38,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:38,177 INFO L435 NwaCegarLoop]: 4441 mSDtfsCounter, 5221 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5237 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:38,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5237 Valid, 21934 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:08:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-11-11 22:08:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 4810. [2024-11-11 22:08:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4577 states have (on average 1.694122787852305) internal successors, (7754), 4588 states have internal predecessors, (7754), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-11 22:08:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 8125 transitions. [2024-11-11 22:08:38,301 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 8125 transitions. Word has length 146 [2024-11-11 22:08:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:38,301 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 8125 transitions. [2024-11-11 22:08:38,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 8125 transitions. [2024-11-11 22:08:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:38,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:38,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:38,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:08:38,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:38,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash -527244744, now seen corresponding path program 1 times [2024-11-11 22:08:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:38,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406665608] [2024-11-11 22:08:38,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406665608] [2024-11-11 22:08:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406665608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:38,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:38,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916554312] [2024-11-11 22:08:38,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:38,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:38,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:38,520 INFO L87 Difference]: Start difference. First operand 4810 states and 8125 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:41,026 INFO L93 Difference]: Finished difference Result 11513 states and 18733 transitions. [2024-11-11 22:08:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:41,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:41,059 INFO L225 Difference]: With dead ends: 11513 [2024-11-11 22:08:41,060 INFO L226 Difference]: Without dead ends: 8841 [2024-11-11 22:08:41,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:41,071 INFO L435 NwaCegarLoop]: 4441 mSDtfsCounter, 5220 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5236 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:41,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5236 Valid, 21934 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:08:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2024-11-11 22:08:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 7171. [2024-11-11 22:08:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7171 states, 6738 states have (on average 1.6444048679133274) internal successors, (11080), 6757 states have internal predecessors, (11080), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-11 22:08:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 11801 transitions. [2024-11-11 22:08:41,408 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 11801 transitions. Word has length 146 [2024-11-11 22:08:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:41,408 INFO L471 AbstractCegarLoop]: Abstraction has 7171 states and 11801 transitions. [2024-11-11 22:08:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 11801 transitions. [2024-11-11 22:08:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:41,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:41,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:08:41,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -39197638, now seen corresponding path program 1 times [2024-11-11 22:08:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677671398] [2024-11-11 22:08:41,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677671398] [2024-11-11 22:08:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677671398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:41,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:41,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923535995] [2024-11-11 22:08:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:41,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:41,626 INFO L87 Difference]: Start difference. First operand 7171 states and 11801 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:43,863 INFO L93 Difference]: Finished difference Result 20032 states and 32175 transitions. [2024-11-11 22:08:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:43,893 INFO L225 Difference]: With dead ends: 20032 [2024-11-11 22:08:43,893 INFO L226 Difference]: Without dead ends: 14999 [2024-11-11 22:08:43,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:43,905 INFO L435 NwaCegarLoop]: 4242 mSDtfsCounter, 5301 mSDsluCounter, 16917 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5317 SdHoareTripleChecker+Valid, 21159 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:43,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5317 Valid, 21159 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:08:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-11 22:08:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11908. [2024-11-11 22:08:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6030699774266366) internal successors, (17754), 11110 states have internal predecessors, (17754), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-11 22:08:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19229 transitions. [2024-11-11 22:08:44,283 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19229 transitions. Word has length 146 [2024-11-11 22:08:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:44,283 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19229 transitions. [2024-11-11 22:08:44,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19229 transitions. [2024-11-11 22:08:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:44,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:44,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:44,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:08:44,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:44,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1131832840, now seen corresponding path program 1 times [2024-11-11 22:08:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490370586] [2024-11-11 22:08:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490370586] [2024-11-11 22:08:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490370586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198090055] [2024-11-11 22:08:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:44,473 INFO L87 Difference]: Start difference. First operand 11908 states and 19229 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:45,926 INFO L93 Difference]: Finished difference Result 24936 states and 40142 transitions. [2024-11-11 22:08:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:08:45,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:45,967 INFO L225 Difference]: With dead ends: 24936 [2024-11-11 22:08:45,967 INFO L226 Difference]: Without dead ends: 15166 [2024-11-11 22:08:45,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:08:45,992 INFO L435 NwaCegarLoop]: 4217 mSDtfsCounter, 4877 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 20864 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:45,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4894 Valid, 20864 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:08:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15166 states. [2024-11-11 22:08:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15166 to 11908. [2024-11-11 22:08:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6000902934537247) internal successors, (17721), 11110 states have internal predecessors, (17721), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-11 22:08:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19196 transitions. [2024-11-11 22:08:46,408 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19196 transitions. Word has length 146 [2024-11-11 22:08:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:46,410 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19196 transitions. [2024-11-11 22:08:46,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19196 transitions. [2024-11-11 22:08:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:46,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:46,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:46,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:08:46,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:46,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1880962170, now seen corresponding path program 1 times [2024-11-11 22:08:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684991774] [2024-11-11 22:08:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684991774] [2024-11-11 22:08:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684991774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:46,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:46,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609754844] [2024-11-11 22:08:46,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:46,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:46,595 INFO L87 Difference]: Start difference. First operand 11908 states and 19196 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:49,752 INFO L93 Difference]: Finished difference Result 37037 states and 59021 transitions. [2024-11-11 22:08:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:49,816 INFO L225 Difference]: With dead ends: 37037 [2024-11-11 22:08:49,816 INFO L226 Difference]: Without dead ends: 27267 [2024-11-11 22:08:49,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:49,839 INFO L435 NwaCegarLoop]: 4441 mSDtfsCounter, 5211 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5227 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:49,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5227 Valid, 21934 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:08:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27267 states. [2024-11-11 22:08:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27267 to 21446. [2024-11-11 22:08:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21446 states, 19813 states have (on average 1.5705344975521123) internal successors, (31117), 19880 states have internal predecessors, (31117), 1177 states have call successors, (1177), 391 states have call predecessors, (1177), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-11 22:08:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21446 states to 21446 states and 34262 transitions. [2024-11-11 22:08:50,686 INFO L78 Accepts]: Start accepts. Automaton has 21446 states and 34262 transitions. Word has length 146 [2024-11-11 22:08:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:50,687 INFO L471 AbstractCegarLoop]: Abstraction has 21446 states and 34262 transitions. [2024-11-11 22:08:50,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21446 states and 34262 transitions. [2024-11-11 22:08:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:50,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:50,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:08:50,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:50,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash 38486456, now seen corresponding path program 1 times [2024-11-11 22:08:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892293646] [2024-11-11 22:08:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:50,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892293646] [2024-11-11 22:08:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892293646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:50,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:50,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026380688] [2024-11-11 22:08:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:50,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:50,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:50,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:50,870 INFO L87 Difference]: Start difference. First operand 21446 states and 34262 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:54,699 INFO L93 Difference]: Finished difference Result 71117 states and 113589 transitions. [2024-11-11 22:08:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:08:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:54,857 INFO L225 Difference]: With dead ends: 71117 [2024-11-11 22:08:54,857 INFO L226 Difference]: Without dead ends: 51809 [2024-11-11 22:08:54,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:54,905 INFO L435 NwaCegarLoop]: 4441 mSDtfsCounter, 5216 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:54,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 21934 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 22:08:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2024-11-11 22:08:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 40583. [2024-11-11 22:08:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40583 states, 37350 states have (on average 1.55285140562249) internal successors, (57999), 37481 states have internal predecessors, (57999), 2329 states have call successors, (2329), 775 states have call predecessors, (2329), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-11 22:08:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40583 states to 40583 states and 64970 transitions. [2024-11-11 22:08:56,888 INFO L78 Accepts]: Start accepts. Automaton has 40583 states and 64970 transitions. Word has length 146 [2024-11-11 22:08:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:56,888 INFO L471 AbstractCegarLoop]: Abstraction has 40583 states and 64970 transitions. [2024-11-11 22:08:56,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40583 states and 64970 transitions. [2024-11-11 22:08:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:08:56,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:56,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:56,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:08:56,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1683516230, now seen corresponding path program 1 times [2024-11-11 22:08:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827677884] [2024-11-11 22:08:56,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:08:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:08:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:08:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:08:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:57,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827677884] [2024-11-11 22:08:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827677884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:57,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:57,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:57,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142647269] [2024-11-11 22:08:57,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:57,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:57,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:57,068 INFO L87 Difference]: Start difference. First operand 40583 states and 64970 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:03,856 INFO L93 Difference]: Finished difference Result 154890 states and 248505 transitions. [2024-11-11 22:09:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:09:03,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 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 146 [2024-11-11 22:09:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:04,244 INFO L225 Difference]: With dead ends: 154890 [2024-11-11 22:09:04,245 INFO L226 Difference]: Without dead ends: 116445 [2024-11-11 22:09:04,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:09:04,359 INFO L435 NwaCegarLoop]: 4438 mSDtfsCounter, 5293 mSDsluCounter, 17482 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 21920 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:04,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 21920 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 22:09:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116445 states. [2024-11-11 22:09:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116445 to 77449. [2024-11-11 22:09:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77449 states, 71144 states have (on average 1.541254357359721) internal successors, (109651), 71403 states have internal predecessors, (109651), 4505 states have call successors, (4505), 1543 states have call predecessors, (4505), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-11 22:09:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77449 states to 77449 states and 125476 transitions. [2024-11-11 22:09:08,808 INFO L78 Accepts]: Start accepts. Automaton has 77449 states and 125476 transitions. Word has length 146 [2024-11-11 22:09:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:08,809 INFO L471 AbstractCegarLoop]: Abstraction has 77449 states and 125476 transitions. [2024-11-11 22:09:08,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77449 states and 125476 transitions. [2024-11-11 22:09:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:09:08,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:08,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:09:08,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 245415996, now seen corresponding path program 1 times [2024-11-11 22:09:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191753828] [2024-11-11 22:09:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:09:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:09,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:09:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:09,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:09:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:09,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:09:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:09,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191753828] [2024-11-11 22:09:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191753828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:09,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:09,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:09,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901387528] [2024-11-11 22:09:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:09,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:09,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:09,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:09,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:09,253 INFO L87 Difference]: Start difference. First operand 77449 states and 125476 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)