./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.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_label43+token_ring.01.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 b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:09:24,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:09:24,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:09:24,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:09:24,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:09:24,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:09:24,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:09:24,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:09:24,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:09:24,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:09:24,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:09:24,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:09:24,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:09:24,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:09:24,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:09:24,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:09:24,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:09:24,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:09:24,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:09:24,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:09:24,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:09:24,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:09:24,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:09:24,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:09:24,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:09:24,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:09:24,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:09:24,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:09:24,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:09:24,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:09:24,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:09:24,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:09:24,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:09:24,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:09:24,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:09:24,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:09:24,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:09:24,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:09:24,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:09:24,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:09:24,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:09:24,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:09:24,293 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 -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2024-11-11 22:09:24,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:09:24,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:09:24,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:09:24,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:09:24,576 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:09:24,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-11-11 22:09:26,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:09:27,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:09:27,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-11-11 22:09:27,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252af060b/d952cf2eec5f405e9268343b2f76f4ea/FLAG67fe8a3b3 [2024-11-11 22:09:27,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252af060b/d952cf2eec5f405e9268343b2f76f4ea [2024-11-11 22:09:27,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:09:27,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:09:27,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:09:27,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:09:27,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:09:27,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:09:27" (1/1) ... [2024-11-11 22:09:27,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c79efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:27, skipping insertion in model container [2024-11-11 22:09:27,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:09:27" (1/1) ... [2024-11-11 22:09:27,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:09:29,245 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_label43+token_ring.01.cil-2.c[381679,381692] [2024-11-11 22:09:29,268 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_label43+token_ring.01.cil-2.c[383339,383352] [2024-11-11 22:09:29,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:09:29,407 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:09:30,280 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_label43+token_ring.01.cil-2.c[381679,381692] [2024-11-11 22:09:30,289 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_label43+token_ring.01.cil-2.c[383339,383352] [2024-11-11 22:09:30,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:09:30,382 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:09:30,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30 WrapperNode [2024-11-11 22:09:30,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:09:30,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:09:30,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:09:30,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:09:30,391 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:09:30" (1/1) ... [2024-11-11 22:09:30,478 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:09:30" (1/1) ... [2024-11-11 22:09:30,828 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-11-11 22:09:30,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:09:30,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:09:30,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:09:30,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:09:30,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:30,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:31,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:31,180 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:09:31,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:31,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:31,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:31,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:31,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:32,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:32,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:09:32,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:09:32,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:09:32,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:09:32,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (1/1) ... [2024-11-11 22:09:32,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:09:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:32,167 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:09:32,182 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:09:32,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:09:32,285 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:09:32,285 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:09:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:09:32,286 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:09:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:09:32,286 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:09:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:09:32,286 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:09:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:09:32,286 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:09:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:09:32,287 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:09:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:09:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:09:32,287 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:09:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:09:32,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:09:32,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:09:32,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:09:40,780 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-11 22:09:40,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:09:40,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:09:40,841 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-11 22:09:40,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:09:40 BoogieIcfgContainer [2024-11-11 22:09:40,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:09:40,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:09:40,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:09:40,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:09:40,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:09:27" (1/3) ... [2024-11-11 22:09:40,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d9b748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:09:40, skipping insertion in model container [2024-11-11 22:09:40,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:09:30" (2/3) ... [2024-11-11 22:09:40,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d9b748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:09:40, skipping insertion in model container [2024-11-11 22:09:40,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:09:40" (3/3) ... [2024-11-11 22:09:40,854 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2024-11-11 22:09:40,873 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:09:40,873 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:09:41,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:09:41,026 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;@fbf2a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:09:41,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:09:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 2300 states, 2273 states have (on average 1.8583369995600527) internal successors, (4224), 2278 states have internal predecessors, (4224), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-11 22:09:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 22:09:41,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:41,055 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] [2024-11-11 22:09:41,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:41,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash -628171245, now seen corresponding path program 1 times [2024-11-11 22:09:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569356905] [2024-11-11 22:09:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:41,691 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:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569356905] [2024-11-11 22:09:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569356905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:41,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:41,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:09:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186890024] [2024-11-11 22:09:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:09:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:09:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:09:41,738 INFO L87 Difference]: Start difference. First operand has 2300 states, 2273 states have (on average 1.8583369995600527) internal successors, (4224), 2278 states have internal predecessors, (4224), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:42,625 INFO L93 Difference]: Finished difference Result 4733 states and 8726 transitions. [2024-11-11 22:09:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:09:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2024-11-11 22:09:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:42,673 INFO L225 Difference]: With dead ends: 4733 [2024-11-11 22:09:42,673 INFO L226 Difference]: Without dead ends: 2372 [2024-11-11 22:09:42,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:09:42,687 INFO L435 NwaCegarLoop]: 4135 mSDtfsCounter, 4339 mSDsluCounter, 12388 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 16523 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:42,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 16523 Invalid, 495 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:09:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2024-11-11 22:09:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2329. [2024-11-11 22:09:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2287 states have (on average 1.8369042413642327) internal successors, (4201), 2291 states have internal predecessors, (4201), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-11 22:09:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4256 transitions. [2024-11-11 22:09:42,873 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4256 transitions. Word has length 58 [2024-11-11 22:09:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:42,874 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4256 transitions. [2024-11-11 22:09:42,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4256 transitions. [2024-11-11 22:09:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 22:09:42,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:42,879 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] [2024-11-11 22:09:42,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:09:42,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:42,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1166087951, now seen corresponding path program 1 times [2024-11-11 22:09:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762985590] [2024-11-11 22:09:42,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:43,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:43,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:43,065 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:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762985590] [2024-11-11 22:09:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762985590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624317688] [2024-11-11 22:09:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:43,069 INFO L87 Difference]: Start difference. First operand 2329 states and 4256 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:44,033 INFO L93 Difference]: Finished difference Result 2686 states and 4770 transitions. [2024-11-11 22:09:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:44,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-11 22:09:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:44,052 INFO L225 Difference]: With dead ends: 2686 [2024-11-11 22:09:44,052 INFO L226 Difference]: Without dead ends: 2487 [2024-11-11 22:09:44,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:09:44,057 INFO L435 NwaCegarLoop]: 4140 mSDtfsCounter, 4259 mSDsluCounter, 16400 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4267 SdHoareTripleChecker+Valid, 20540 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:44,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4267 Valid, 20540 Invalid, 756 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:09:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-11-11 22:09:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2421. [2024-11-11 22:09:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2362 states have (on average 1.8238780694326842) internal successors, (4308), 2367 states have internal predecessors, (4308), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-11-11 22:09:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4385 transitions. [2024-11-11 22:09:44,158 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4385 transitions. Word has length 58 [2024-11-11 22:09:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:44,160 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4385 transitions. [2024-11-11 22:09:44,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4385 transitions. [2024-11-11 22:09:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 22:09:44,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:44,163 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] [2024-11-11 22:09:44,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:09:44,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:44,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2059574289, now seen corresponding path program 1 times [2024-11-11 22:09:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489969339] [2024-11-11 22:09:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:44,340 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:44,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489969339] [2024-11-11 22:09:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489969339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:44,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505717000] [2024-11-11 22:09:44,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:44,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:44,344 INFO L87 Difference]: Start difference. First operand 2421 states and 4385 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:45,294 INFO L93 Difference]: Finished difference Result 3043 states and 5273 transitions. [2024-11-11 22:09:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:09:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-11 22:09:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:45,309 INFO L225 Difference]: With dead ends: 3043 [2024-11-11 22:09:45,309 INFO L226 Difference]: Without dead ends: 2752 [2024-11-11 22:09:45,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:09:45,313 INFO L435 NwaCegarLoop]: 4136 mSDtfsCounter, 4314 mSDsluCounter, 16392 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4324 SdHoareTripleChecker+Valid, 20528 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:45,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4324 Valid, 20528 Invalid, 750 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [48 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:09:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2024-11-11 22:09:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2600. [2024-11-11 22:09:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2509 states have (on average 1.8011159824631326) internal successors, (4519), 2516 states have internal predecessors, (4519), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-11 22:09:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 4640 transitions. [2024-11-11 22:09:45,400 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 4640 transitions. Word has length 58 [2024-11-11 22:09:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:45,400 INFO L471 AbstractCegarLoop]: Abstraction has 2600 states and 4640 transitions. [2024-11-11 22:09:45,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4640 transitions. [2024-11-11 22:09:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 22:09:45,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:45,415 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] [2024-11-11 22:09:45,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:09:45,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:45,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 10186447, now seen corresponding path program 1 times [2024-11-11 22:09:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290908983] [2024-11-11 22:09:45,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:45,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:45,703 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:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290908983] [2024-11-11 22:09:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290908983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:45,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:45,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:45,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21089771] [2024-11-11 22:09:45,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:45,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:45,706 INFO L87 Difference]: Start difference. First operand 2600 states and 4640 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:46,534 INFO L93 Difference]: Finished difference Result 3607 states and 6076 transitions. [2024-11-11 22:09:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:09:46,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-11 22:09:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:46,550 INFO L225 Difference]: With dead ends: 3607 [2024-11-11 22:09:46,550 INFO L226 Difference]: Without dead ends: 3137 [2024-11-11 22:09:46,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:09:46,554 INFO L435 NwaCegarLoop]: 4124 mSDtfsCounter, 4254 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4261 SdHoareTripleChecker+Valid, 20498 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:46,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4261 Valid, 20498 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:09:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2024-11-11 22:09:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2907. [2024-11-11 22:09:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2758 states have (on average 1.7632342277012327) internal successors, (4863), 2769 states have internal predecessors, (4863), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-11-11 22:09:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 5070 transitions. [2024-11-11 22:09:46,655 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 5070 transitions. Word has length 58 [2024-11-11 22:09:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:46,656 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 5070 transitions. [2024-11-11 22:09:46,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 5070 transitions. [2024-11-11 22:09:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 22:09:46,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:46,658 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] [2024-11-11 22:09:46,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:09:46,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:46,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -887206831, now seen corresponding path program 1 times [2024-11-11 22:09:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513913282] [2024-11-11 22:09:46,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:46,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:46,864 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:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513913282] [2024-11-11 22:09:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513913282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:46,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:46,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:09:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901910820] [2024-11-11 22:09:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:46,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:09:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:46,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:09:46,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:09:46,866 INFO L87 Difference]: Start difference. First operand 2907 states and 5070 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:47,922 INFO L93 Difference]: Finished difference Result 4299 states and 7044 transitions. [2024-11-11 22:09:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:09:47,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2024-11-11 22:09:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:47,937 INFO L225 Difference]: With dead ends: 4299 [2024-11-11 22:09:47,937 INFO L226 Difference]: Without dead ends: 3523 [2024-11-11 22:09:47,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:09:47,941 INFO L435 NwaCegarLoop]: 4145 mSDtfsCounter, 4374 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4397 SdHoareTripleChecker+Valid, 16340 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:47,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 16340 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:09:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-11-11 22:09:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3318. [2024-11-11 22:09:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 3086 states have (on average 1.7171095268956578) internal successors, (5299), 3106 states have internal predecessors, (5299), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-11 22:09:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 5614 transitions. [2024-11-11 22:09:48,050 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 5614 transitions. Word has length 58 [2024-11-11 22:09:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:48,050 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 5614 transitions. [2024-11-11 22:09:48,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 5614 transitions. [2024-11-11 22:09:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:09:48,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:48,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:48,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:09:48,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1808175973, now seen corresponding path program 1 times [2024-11-11 22:09:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289024938] [2024-11-11 22:09:48,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 22:09:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 22:09:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 22:09:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289024938] [2024-11-11 22:09:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289024938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719298149] [2024-11-11 22:09:48,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:48,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:48,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:48,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:09:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:48,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:09:48,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:09:48,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:48,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719298149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:48,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:48,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:09:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222760176] [2024-11-11 22:09:48,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:48,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:09:48,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:09:48,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:48,410 INFO L87 Difference]: Start difference. First operand 3318 states and 5614 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 22:09:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:48,542 INFO L93 Difference]: Finished difference Result 5571 states and 8787 transitions. [2024-11-11 22:09:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:09:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-11-11 22:09:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:48,562 INFO L225 Difference]: With dead ends: 5571 [2024-11-11 22:09:48,562 INFO L226 Difference]: Without dead ends: 4385 [2024-11-11 22:09:48,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:48,570 INFO L435 NwaCegarLoop]: 4232 mSDtfsCounter, 115 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 8341 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:48,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 8341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:09:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2024-11-11 22:09:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 4385. [2024-11-11 22:09:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4385 states, 3944 states have (on average 1.6364097363083163) internal successors, (6454), 3977 states have internal predecessors, (6454), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2024-11-11 22:09:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 7085 transitions. [2024-11-11 22:09:48,759 INFO L78 Accepts]: Start accepts. Automaton has 4385 states and 7085 transitions. Word has length 94 [2024-11-11 22:09:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:48,760 INFO L471 AbstractCegarLoop]: Abstraction has 4385 states and 7085 transitions. [2024-11-11 22:09:48,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 22:09:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4385 states and 7085 transitions. [2024-11-11 22:09:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 22:09:48,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:48,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 22:09:48,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 22:09:48,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2088529656, now seen corresponding path program 1 times [2024-11-11 22:09:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865811579] [2024-11-11 22:09:48,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 22:09:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 22:09:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 22:09:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:09:49,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:49,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865811579] [2024-11-11 22:09:49,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865811579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:49,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812356094] [2024-11-11 22:09:49,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:49,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:49,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:49,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:09:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:49,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:09:49,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:09:49,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812356094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-11 22:09:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435391773] [2024-11-11 22:09:49,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:09:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:49,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:09:49,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:49,661 INFO L87 Difference]: Start difference. First operand 4385 states and 7085 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 22:09:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:50,102 INFO L93 Difference]: Finished difference Result 8749 states and 13152 transitions. [2024-11-11 22:09:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:09:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 121 [2024-11-11 22:09:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:50,131 INFO L225 Difference]: With dead ends: 8749 [2024-11-11 22:09:50,131 INFO L226 Difference]: Without dead ends: 6499 [2024-11-11 22:09:50,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:50,140 INFO L435 NwaCegarLoop]: 4133 mSDtfsCounter, 4039 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4039 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:50,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4039 Valid, 4267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:09:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2024-11-11 22:09:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6439. [2024-11-11 22:09:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6439 states, 5604 states have (on average 1.5522840827980013) internal successors, (8699), 5666 states have internal predecessors, (8699), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2024-11-11 22:09:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 9862 transitions. [2024-11-11 22:09:50,420 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 9862 transitions. Word has length 121 [2024-11-11 22:09:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 6439 states and 9862 transitions. [2024-11-11 22:09:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 22:09:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 9862 transitions. [2024-11-11 22:09:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 22:09:50,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:50,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 22:09:50,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 22:09:50,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:50,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1607628711, now seen corresponding path program 1 times [2024-11-11 22:09:50,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:50,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870005399] [2024-11-11 22:09:50,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 22:09:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 22:09:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 22:09:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 22:09:50,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870005399] [2024-11-11 22:09:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870005399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189660014] [2024-11-11 22:09:50,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:50,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:50,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:50,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:09:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:50,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:09:50,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 22:09:50,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189660014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:50,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:09:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293942715] [2024-11-11 22:09:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:09:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:09:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:50,941 INFO L87 Difference]: Start difference. First operand 6439 states and 9862 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 22:09:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:51,185 INFO L93 Difference]: Finished difference Result 9789 states and 14469 transitions. [2024-11-11 22:09:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:09:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 138 [2024-11-11 22:09:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:51,216 INFO L225 Difference]: With dead ends: 9789 [2024-11-11 22:09:51,216 INFO L226 Difference]: Without dead ends: 6767 [2024-11-11 22:09:51,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:51,229 INFO L435 NwaCegarLoop]: 4137 mSDtfsCounter, 4059 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4279 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:51,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4279 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:09:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6767 states. [2024-11-11 22:09:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6767 to 6729. [2024-11-11 22:09:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6729 states, 5862 states have (on average 1.5272944387581031) internal successors, (8953), 5924 states have internal predecessors, (8953), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2024-11-11 22:09:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 10154 transitions. [2024-11-11 22:09:51,709 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 10154 transitions. Word has length 138 [2024-11-11 22:09:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:51,709 INFO L471 AbstractCegarLoop]: Abstraction has 6729 states and 10154 transitions. [2024-11-11 22:09:51,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 22:09:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 10154 transitions. [2024-11-11 22:09:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 22:09:51,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:51,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:09:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:51,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -247267866, now seen corresponding path program 1 times [2024-11-11 22:09:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656248772] [2024-11-11 22:09:51,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 22:09:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 22:09:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 22:09:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 22:09:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 22:09:52,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656248772] [2024-11-11 22:09:52,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656248772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144351565] [2024-11-11 22:09:52,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:52,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:52,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:52,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:52,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:09:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:52,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:09:52,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 22:09:52,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144351565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:09:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819344087] [2024-11-11 22:09:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:52,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:09:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:09:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:52,212 INFO L87 Difference]: Start difference. First operand 6729 states and 10154 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 22:09:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:52,829 INFO L93 Difference]: Finished difference Result 15557 states and 22200 transitions. [2024-11-11 22:09:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:09:52,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-11 22:09:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:52,877 INFO L225 Difference]: With dead ends: 15557 [2024-11-11 22:09:52,878 INFO L226 Difference]: Without dead ends: 10965 [2024-11-11 22:09:52,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:52,897 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 127 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 8338 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:52,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 8338 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:09:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10965 states. [2024-11-11 22:09:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10965 to 10949. [2024-11-11 22:09:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10949 states, 9268 states have (on average 1.4442166594734571) internal successors, (13385), 9390 states have internal predecessors, (13385), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-11-11 22:09:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10949 states to 10949 states and 15862 transitions. [2024-11-11 22:09:53,654 INFO L78 Accepts]: Start accepts. Automaton has 10949 states and 15862 transitions. Word has length 139 [2024-11-11 22:09:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:53,657 INFO L471 AbstractCegarLoop]: Abstraction has 10949 states and 15862 transitions. [2024-11-11 22:09:53,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 22:09:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 10949 states and 15862 transitions. [2024-11-11 22:09:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 22:09:53,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:53,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 22:09:53,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:53,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:53,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -795398658, now seen corresponding path program 1 times [2024-11-11 22:09:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:53,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137790766] [2024-11-11 22:09:53,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:09:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:09:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:09:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:53,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 22:09:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:09:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137790766] [2024-11-11 22:09:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137790766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069153909] [2024-11-11 22:09:54,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:54,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:54,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 22:09:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:54,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:09:54,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 22:09:54,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069153909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:09:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461269446] [2024-11-11 22:09:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:54,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:09:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:09:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:54,144 INFO L87 Difference]: Start difference. First operand 10949 states and 15862 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 22:09:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:54,458 INFO L93 Difference]: Finished difference Result 15531 states and 22362 transitions. [2024-11-11 22:09:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:09:54,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 140 [2024-11-11 22:09:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:54,503 INFO L225 Difference]: With dead ends: 15531 [2024-11-11 22:09:54,503 INFO L226 Difference]: Without dead ends: 10985 [2024-11-11 22:09:54,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:54,520 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 112 mSDsluCounter, 4101 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 8297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:54,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 8297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:09:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10985 states. [2024-11-11 22:09:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10985 to 10925. [2024-11-11 22:09:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10925 states, 9244 states have (on average 1.4310904370402424) internal successors, (13229), 9366 states have internal predecessors, (13229), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-11-11 22:09:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 15706 transitions. [2024-11-11 22:09:55,111 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 15706 transitions. Word has length 140 [2024-11-11 22:09:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:55,112 INFO L471 AbstractCegarLoop]: Abstraction has 10925 states and 15706 transitions. [2024-11-11 22:09:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 22:09:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 15706 transitions. [2024-11-11 22:09:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 22:09:55,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:55,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 22:09:55,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 22:09:55,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -746004992, now seen corresponding path program 1 times [2024-11-11 22:09:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434391747] [2024-11-11 22:09:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:09:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:09:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:09:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 22:09:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:09:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434391747] [2024-11-11 22:09:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434391747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724181286] [2024-11-11 22:09:55,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:55,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 22:09:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:55,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:09:55,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 22:09:55,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724181286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:09:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483485182] [2024-11-11 22:09:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:55,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:09:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:09:55,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:55,583 INFO L87 Difference]: Start difference. First operand 10925 states and 15706 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 22:09:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:55,988 INFO L93 Difference]: Finished difference Result 17437 states and 24680 transitions. [2024-11-11 22:09:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:09:55,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2024-11-11 22:09:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:56,036 INFO L225 Difference]: With dead ends: 17437 [2024-11-11 22:09:56,036 INFO L226 Difference]: Without dead ends: 9705 [2024-11-11 22:09:56,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:09:56,066 INFO L435 NwaCegarLoop]: 4114 mSDtfsCounter, 4090 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:56,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 4138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:09:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2024-11-11 22:09:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 9257. [2024-11-11 22:09:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9257 states, 7902 states have (on average 1.4172361427486713) internal successors, (11199), 7992 states have internal predecessors, (11199), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2024-11-11 22:09:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9257 states to 9257 states and 13052 transitions. [2024-11-11 22:09:56,562 INFO L78 Accepts]: Start accepts. Automaton has 9257 states and 13052 transitions. Word has length 140 [2024-11-11 22:09:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:56,562 INFO L471 AbstractCegarLoop]: Abstraction has 9257 states and 13052 transitions. [2024-11-11 22:09:56,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 22:09:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9257 states and 13052 transitions. [2024-11-11 22:09:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 22:09:56,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:56,578 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 22:09:56,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:56,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:56,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash 330406047, now seen corresponding path program 1 times [2024-11-11 22:09:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360268076] [2024-11-11 22:09:56,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:09:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:09:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:09:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 22:09:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:09:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360268076] [2024-11-11 22:09:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360268076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675541145] [2024-11-11 22:09:56,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:56,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:56,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:56,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:56,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 22:09:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:57,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 22:09:57,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-11 22:09:57,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675541145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-11 22:09:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239639125] [2024-11-11 22:09:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:09:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:09:57,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:09:57,119 INFO L87 Difference]: Start difference. First operand 9257 states and 13052 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 22:09:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:57,687 INFO L93 Difference]: Finished difference Result 12037 states and 16723 transitions. [2024-11-11 22:09:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:09:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2024-11-11 22:09:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:57,712 INFO L225 Difference]: With dead ends: 12037 [2024-11-11 22:09:57,712 INFO L226 Difference]: Without dead ends: 7421 [2024-11-11 22:09:57,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:09:57,723 INFO L435 NwaCegarLoop]: 4060 mSDtfsCounter, 4109 mSDsluCounter, 8075 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 12135 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:57,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 12135 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:09:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7421 states. [2024-11-11 22:09:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7421 to 7397. [2024-11-11 22:09:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7397 states, 6400 states have (on average 1.43515625) internal successors, (9185), 6454 states have internal predecessors, (9185), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-11-11 22:09:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7397 states to 7397 states and 10518 transitions. [2024-11-11 22:09:58,047 INFO L78 Accepts]: Start accepts. Automaton has 7397 states and 10518 transitions. Word has length 141 [2024-11-11 22:09:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:58,048 INFO L471 AbstractCegarLoop]: Abstraction has 7397 states and 10518 transitions. [2024-11-11 22:09:58,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 22:09:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7397 states and 10518 transitions. [2024-11-11 22:09:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 22:09:58,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:58,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 22:09:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:58,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -292875555, now seen corresponding path program 1 times [2024-11-11 22:09:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540083931] [2024-11-11 22:09:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:09:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:09:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:09:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 22:09:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:09:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540083931] [2024-11-11 22:09:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540083931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150997090] [2024-11-11 22:09:58,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:58,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:58,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 22:09:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:58,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 22:09:58,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-11 22:09:58,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:09:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150997090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:58,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:09:58,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-11 22:09:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837108295] [2024-11-11 22:09:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:58,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:09:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:58,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:09:58,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:09:58,565 INFO L87 Difference]: Start difference. First operand 7397 states and 10518 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 22:09:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:58,909 INFO L93 Difference]: Finished difference Result 11699 states and 16090 transitions. [2024-11-11 22:09:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:09:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2024-11-11 22:09:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:58,942 INFO L225 Difference]: With dead ends: 11699 [2024-11-11 22:09:58,942 INFO L226 Difference]: Without dead ends: 7025 [2024-11-11 22:09:58,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:09:58,959 INFO L435 NwaCegarLoop]: 4058 mSDtfsCounter, 4147 mSDsluCounter, 8070 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4156 SdHoareTripleChecker+Valid, 12128 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:58,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4156 Valid, 12128 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:09:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2024-11-11 22:09:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 5263. [2024-11-11 22:09:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 4686 states have (on average 1.4874093043107128) internal successors, (6970), 4716 states have internal predecessors, (6970), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-11-11 22:09:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 7740 transitions. [2024-11-11 22:09:59,211 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 7740 transitions. Word has length 141 [2024-11-11 22:09:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:59,211 INFO L471 AbstractCegarLoop]: Abstraction has 5263 states and 7740 transitions. [2024-11-11 22:09:59,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 22:09:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 7740 transitions. [2024-11-11 22:09:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 22:09:59,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:59,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 22:09:59,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 22:09:59,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:59,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -174434081, now seen corresponding path program 1 times [2024-11-11 22:09:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979547854] [2024-11-11 22:09:59,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:09:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:09:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:09:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:09:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:09:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:09:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:09:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:09:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 22:09:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:09:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979547854] [2024-11-11 22:09:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979547854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108142916] [2024-11-11 22:09:59,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:59,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:09:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:09:59,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:09:59,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 22:09:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:59,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 22:09:59,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:09:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 22:09:59,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:09:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:09:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108142916] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:09:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:09:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 9 [2024-11-11 22:09:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422191225] [2024-11-11 22:09:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:59,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:09:59,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:09:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:09:59,837 INFO L87 Difference]: Start difference. First operand 5263 states and 7740 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 22:10:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:10:00,191 INFO L93 Difference]: Finished difference Result 9308 states and 12564 transitions. [2024-11-11 22:10:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:10:00,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 141 [2024-11-11 22:10:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:10:00,219 INFO L225 Difference]: With dead ends: 9308 [2024-11-11 22:10:00,219 INFO L226 Difference]: Without dead ends: 7812 [2024-11-11 22:10:00,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:10:00,227 INFO L435 NwaCegarLoop]: 4209 mSDtfsCounter, 4186 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 8370 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:10:00,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 8370 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:10:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2024-11-11 22:10:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 6508. [2024-11-11 22:10:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 5707 states have (on average 1.4261433327492552) internal successors, (8139), 5745 states have internal predecessors, (8139), 459 states have call successors, (459), 317 states have call predecessors, (459), 340 states have return successors, (609), 449 states have call predecessors, (609), 457 states have call successors, (609) [2024-11-11 22:10:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 9207 transitions. [2024-11-11 22:10:00,710 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 9207 transitions. Word has length 141 [2024-11-11 22:10:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:10:00,711 INFO L471 AbstractCegarLoop]: Abstraction has 6508 states and 9207 transitions. [2024-11-11 22:10:00,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 22:10:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 9207 transitions. [2024-11-11 22:10:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:10:00,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:10:00,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:00,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-11 22:10:00,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 22:10:00,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:10:00,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:10:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 132066951, now seen corresponding path program 1 times [2024-11-11 22:10:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:10:00,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438925236] [2024-11-11 22:10:00,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:10:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:00,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:10:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:10:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:10:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:10:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:10:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:10:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:10:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:10:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:10:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:10:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 22:10:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:10:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:10:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438925236] [2024-11-11 22:10:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438925236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:10:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370274266] [2024-11-11 22:10:01,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:01,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:10:01,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:10:01,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:10:01,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 22:10:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:01,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:10:01,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:10:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 22:10:01,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:10:01,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370274266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:10:01,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:10:01,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:10:01,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58796105] [2024-11-11 22:10:01,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:10:01,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:10:01,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:10:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:10:01,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:10:01,194 INFO L87 Difference]: Start difference. First operand 6508 states and 9207 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 22:10:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:10:01,685 INFO L93 Difference]: Finished difference Result 8573 states and 11698 transitions. [2024-11-11 22:10:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:10:01,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 145 [2024-11-11 22:10:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:10:01,712 INFO L225 Difference]: With dead ends: 8573 [2024-11-11 22:10:01,712 INFO L226 Difference]: Without dead ends: 6512 [2024-11-11 22:10:01,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:10:01,724 INFO L435 NwaCegarLoop]: 4106 mSDtfsCounter, 0 mSDsluCounter, 4095 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8201 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:10:01,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8201 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:10:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2024-11-11 22:10:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 6512. [2024-11-11 22:10:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 5711 states have (on average 1.4258448607949572) internal successors, (8143), 5749 states have internal predecessors, (8143), 459 states have call successors, (459), 317 states have call predecessors, (459), 340 states have return successors, (609), 449 states have call predecessors, (609), 457 states have call successors, (609) [2024-11-11 22:10:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 9211 transitions. [2024-11-11 22:10:02,198 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 9211 transitions. Word has length 145 [2024-11-11 22:10:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:10:02,198 INFO L471 AbstractCegarLoop]: Abstraction has 6512 states and 9211 transitions. [2024-11-11 22:10:02,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 22:10:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 9211 transitions. [2024-11-11 22:10:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:10:02,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:10:02,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:02,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 22:10:02,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 22:10:02,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:10:02,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:10:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1028348356, now seen corresponding path program 1 times [2024-11-11 22:10:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:10:02,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316755972] [2024-11-11 22:10:02,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:10:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:10:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:10:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:10:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:10:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:10:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:10:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:10:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:10:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:10:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:10:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 22:10:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:10:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:10:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316755972] [2024-11-11 22:10:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316755972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:10:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172247142] [2024-11-11 22:10:02,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:02,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:10:02,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:10:02,554 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:10:02,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 22:10:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:02,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:10:02,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:10:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 22:10:02,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:10:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172247142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:10:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:10:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-11 22:10:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864191121] [2024-11-11 22:10:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:10:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:10:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:10:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:10:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:10:02,701 INFO L87 Difference]: Start difference. First operand 6512 states and 9211 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 22:10:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:10:03,019 INFO L93 Difference]: Finished difference Result 8754 states and 11947 transitions. [2024-11-11 22:10:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:10:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-11 22:10:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:10:03,038 INFO L225 Difference]: With dead ends: 8754 [2024-11-11 22:10:03,038 INFO L226 Difference]: Without dead ends: 5136 [2024-11-11 22:10:03,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:10:03,047 INFO L435 NwaCegarLoop]: 4104 mSDtfsCounter, 0 mSDsluCounter, 12306 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16410 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:10:03,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16410 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:10:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2024-11-11 22:10:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5136. [2024-11-11 22:10:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5136 states, 4579 states have (on average 1.4760864817645774) internal successors, (6759), 4609 states have internal predecessors, (6759), 319 states have call successors, (319), 217 states have call predecessors, (319), 236 states have return successors, (373), 313 states have call predecessors, (373), 317 states have call successors, (373) [2024-11-11 22:10:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5136 states to 5136 states and 7451 transitions. [2024-11-11 22:10:03,274 INFO L78 Accepts]: Start accepts. Automaton has 5136 states and 7451 transitions. Word has length 146 [2024-11-11 22:10:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:10:03,274 INFO L471 AbstractCegarLoop]: Abstraction has 5136 states and 7451 transitions. [2024-11-11 22:10:03,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 22:10:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 7451 transitions. [2024-11-11 22:10:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:10:03,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:10:03,279 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-11 22:10:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 22:10:03,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:10:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:10:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1397305092, now seen corresponding path program 1 times [2024-11-11 22:10:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:10:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648095488] [2024-11-11 22:10:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:10:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:10:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:10:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 22:10:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:10:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:10:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 22:10:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 22:10:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:10:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 22:10:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:10:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 22:10:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 22:10:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:10:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648095488] [2024-11-11 22:10:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648095488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:10:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280712682] [2024-11-11 22:10:03,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:03,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:10:03,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:10:03,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:10:03,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 22:10:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:10:03,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:10:03,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:10:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 22:10:03,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:10:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280712682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:10:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:10:03,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-11 22:10:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134062724] [2024-11-11 22:10:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:10:03,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:10:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:10:03,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:10:03,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:10:03,697 INFO L87 Difference]: Start difference. First operand 5136 states and 7451 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 22:10:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:10:03,857 INFO L93 Difference]: Finished difference Result 6860 states and 9473 transitions. [2024-11-11 22:10:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:10:03,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-11 22:10:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:10:03,866 INFO L225 Difference]: With dead ends: 6860 [2024-11-11 22:10:03,867 INFO L226 Difference]: Without dead ends: 2926 [2024-11-11 22:10:03,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:10:03,871 INFO L435 NwaCegarLoop]: 4102 mSDtfsCounter, 0 mSDsluCounter, 12300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:10:03,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:10:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2024-11-11 22:10:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2926. [2024-11-11 22:10:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2779 states have (on average 1.6883771140698094) internal successors, (4692), 2787 states have internal predecessors, (4692), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-11-11 22:10:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4863 transitions. [2024-11-11 22:10:03,966 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4863 transitions. Word has length 146 [2024-11-11 22:10:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:10:03,967 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4863 transitions. [2024-11-11 22:10:03,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 22:10:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4863 transitions. [2024-11-11 22:10:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:10:03,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:10:03,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-11 22:10:04,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 22:10:04,170 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:10:04,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:10:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash -707496704, now seen corresponding path program 1 times [2024-11-11 22:10:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:10:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119675716] [2024-11-11 22:10:04,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:10:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:10:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 22:10:04,197 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 22:10:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 22:10:04,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 22:10:04,273 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 22:10:04,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-11 22:10:04,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-11 22:10:04,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:10:04,282 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:10:04,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 22:10:04,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 10:10:04 BoogieIcfgContainer [2024-11-11 22:10:04,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 22:10:04,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 22:10:04,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 22:10:04,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 22:10:04,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:09:40" (3/4) ... [2024-11-11 22:10:04,398 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 22:10:04,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 22:10:04,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 22:10:04,499 INFO L158 Benchmark]: Toolchain (without parser) took 37122.02ms. Allocated memory was 165.7MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 111.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-11 22:10:04,499 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 22:10:04,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3004.87ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 111.8MB in the beginning and 103.7MB in the end (delta: 8.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2024-11-11 22:10:04,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 444.76ms. Allocated memory is still 257.9MB. Free memory was 103.7MB in the beginning and 91.2MB in the end (delta: 12.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-11 22:10:04,500 INFO L158 Benchmark]: Boogie Preprocessor took 1255.98ms. Allocated memory was 257.9MB in the beginning and 515.9MB in the end (delta: 257.9MB). Free memory was 91.2MB in the beginning and 341.8MB in the end (delta: -250.6MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-11-11 22:10:04,500 INFO L158 Benchmark]: RCFGBuilder took 8756.65ms. Allocated memory was 515.9MB in the beginning and 1.0GB in the end (delta: 515.9MB). Free memory was 341.8MB in the beginning and 570.7MB in the end (delta: -228.8MB). Peak memory consumption was 287.1MB. Max. memory is 16.1GB. [2024-11-11 22:10:04,501 INFO L158 Benchmark]: TraceAbstraction took 23551.05ms. Allocated memory was 1.0GB in the beginning and 3.5GB in the end (delta: 2.5GB). Free memory was 569.6MB in the beginning and 1.8GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-11 22:10:04,501 INFO L158 Benchmark]: Witness Printer took 101.87ms. Allocated memory is still 3.5GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 22:10:04,502 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3004.87ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 111.8MB in the beginning and 103.7MB in the end (delta: 8.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 444.76ms. Allocated memory is still 257.9MB. Free memory was 103.7MB in the beginning and 91.2MB in the end (delta: 12.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 1255.98ms. Allocated memory was 257.9MB in the beginning and 515.9MB in the end (delta: 257.9MB). Free memory was 91.2MB in the beginning and 341.8MB in the end (delta: -250.6MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * RCFGBuilder took 8756.65ms. Allocated memory was 515.9MB in the beginning and 1.0GB in the end (delta: 515.9MB). Free memory was 341.8MB in the beginning and 570.7MB in the end (delta: -228.8MB). Peak memory consumption was 287.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23551.05ms. Allocated memory was 1.0GB in the beginning and 3.5GB in the end (delta: 2.5GB). Free memory was 569.6MB in the beginning and 1.8GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 101.87ms. Allocated memory is still 3.5GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11118]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2300 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46597 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46524 mSDsluCounter, 205735 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135375 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3592 IncrementalHoareTripleChecker+Invalid, 3945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 70360 mSDtfsCounter, 3592 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2222 GetRequests, 2078 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10949occurred in iteration=9, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 4408 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3700 NumberOfCodeBlocks, 3700 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3665 ConstructedInterpolants, 0 QuantifiedInterpolants, 5500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5097 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1657/1918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-11 22:10:04,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE