./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.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/systemc/pc_sfifo_1.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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:07:37,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:07:37,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:07:37,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:07:37,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:07:37,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:07:37,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:07:37,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:07:37,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:07:37,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:07:37,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:07:37,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:07:37,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:07:37,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:07:37,183 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:07:37,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:07:37,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:07:37,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:07:37,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:07:37,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:07:37,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:07:37,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:07:37,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:07:37,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:07:37,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:07:37,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:07:37,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:07:37,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:07:37,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:07:37,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:07:37,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:07:37,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:07:37,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:07:37,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:07:37,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:07:37,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:07:37,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:07:37,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:07:37,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:07:37,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:07:37,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:07:37,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:07:37,192 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2024-11-11 21:07:37,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:07:37,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:07:37,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:07:37,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:07:37,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:07:37,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-11 21:07:38,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:07:39,034 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:07:39,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-11 21:07:39,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e1591fd/fe579b320da44b3683e505baa83e075e/FLAGa68fae795 [2024-11-11 21:07:39,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e1591fd/fe579b320da44b3683e505baa83e075e [2024-11-11 21:07:39,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:07:39,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:07:39,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:07:39,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:07:39,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:07:39,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589d6143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39, skipping insertion in model container [2024-11-11 21:07:39,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:07:39,283 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/systemc/pc_sfifo_1.cil-2.c[642,655] [2024-11-11 21:07:39,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:07:39,348 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:07:39,360 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/systemc/pc_sfifo_1.cil-2.c[642,655] [2024-11-11 21:07:39,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:07:39,400 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:07:39,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39 WrapperNode [2024-11-11 21:07:39,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:07:39,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:07:39,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:07:39,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:07:39,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,437 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 204 [2024-11-11 21:07:39,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:07:39,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:07:39,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:07:39,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:07:39,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,464 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 21:07:39,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:07:39,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:07:39,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:07:39,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:07:39,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (1/1) ... [2024-11-11 21:07:39,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:07:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:39,543 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 21:07:39,546 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 21:07:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:07:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 21:07:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 21:07:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:07:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 21:07:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 21:07:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 21:07:39,599 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 21:07:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:07:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:07:39,660 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:07:39,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:07:39,889 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-11 21:07:39,889 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:07:39,903 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:07:39,903 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-11 21:07:39,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:07:39 BoogieIcfgContainer [2024-11-11 21:07:39,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:07:39,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:07:39,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:07:39,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:07:39,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:07:39" (1/3) ... [2024-11-11 21:07:39,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f88b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:07:39, skipping insertion in model container [2024-11-11 21:07:39,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:07:39" (2/3) ... [2024-11-11 21:07:39,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f88b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:07:39, skipping insertion in model container [2024-11-11 21:07:39,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:07:39" (3/3) ... [2024-11-11 21:07:39,913 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-11-11 21:07:39,931 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:07:39,931 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:07:39,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:07:39,990 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;@2b6b25f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:07:39,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:07:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 21:07:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 21:07:40,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:40,002 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] [2024-11-11 21:07:40,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2024-11-11 21:07:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075338097] [2024-11-11 21:07:40,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:40,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 21:07:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:40,350 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 21:07:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075338097] [2024-11-11 21:07:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075338097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221032139] [2024-11-11 21:07:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:40,382 INFO L87 Difference]: Start difference. First operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:07:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:40,579 INFO L93 Difference]: Finished difference Result 214 states and 325 transitions. [2024-11-11 21:07:40,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-11 21:07:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:40,595 INFO L225 Difference]: With dead ends: 214 [2024-11-11 21:07:40,595 INFO L226 Difference]: Without dead ends: 138 [2024-11-11 21:07:40,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:40,603 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 103 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:40,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 260 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-11 21:07:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-11-11 21:07:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 118 states have internal predecessors, (160), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-11 21:07:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2024-11-11 21:07:40,741 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 43 [2024-11-11 21:07:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:40,741 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2024-11-11 21:07:40,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:07:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2024-11-11 21:07:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 21:07:40,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:40,745 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] [2024-11-11 21:07:40,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:07:40,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:40,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2024-11-11 21:07:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:40,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195726939] [2024-11-11 21:07:40,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:07:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:40,899 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 21:07:40,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:40,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195726939] [2024-11-11 21:07:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195726939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927148384] [2024-11-11 21:07:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:40,903 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:07:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:41,057 INFO L93 Difference]: Finished difference Result 380 states and 524 transitions. [2024-11-11 21:07:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 21:07:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:41,060 INFO L225 Difference]: With dead ends: 380 [2024-11-11 21:07:41,062 INFO L226 Difference]: Without dead ends: 256 [2024-11-11 21:07:41,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:41,064 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 100 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:41,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 274 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-11 21:07:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2024-11-11 21:07:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3785310734463276) internal successors, (244), 179 states have internal predecessors, (244), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-11 21:07:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2024-11-11 21:07:41,094 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 274 transitions. Word has length 44 [2024-11-11 21:07:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:41,095 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 274 transitions. [2024-11-11 21:07:41,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:07:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 274 transitions. [2024-11-11 21:07:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 21:07:41,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:41,097 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] [2024-11-11 21:07:41,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:07:41,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:41,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2024-11-11 21:07:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:41,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515356742] [2024-11-11 21:07:41,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:07:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,196 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 21:07:41,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515356742] [2024-11-11 21:07:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515356742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137943891] [2024-11-11 21:07:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:41,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:41,202 INFO L87 Difference]: Start difference. First operand 199 states and 274 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:07:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:41,322 INFO L93 Difference]: Finished difference Result 607 states and 833 transitions. [2024-11-11 21:07:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 21:07:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:41,328 INFO L225 Difference]: With dead ends: 607 [2024-11-11 21:07:41,330 INFO L226 Difference]: Without dead ends: 416 [2024-11-11 21:07:41,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:41,335 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 117 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:41,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 243 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-11 21:07:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 364. [2024-11-11 21:07:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 323 states have (on average 1.3436532507739938) internal successors, (434), 328 states have internal predecessors, (434), 24 states have call successors, (24), 15 states have call predecessors, (24), 16 states have return successors, (34), 20 states have call predecessors, (34), 22 states have call successors, (34) [2024-11-11 21:07:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 492 transitions. [2024-11-11 21:07:41,391 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 492 transitions. Word has length 44 [2024-11-11 21:07:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:41,393 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 492 transitions. [2024-11-11 21:07:41,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:07:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2024-11-11 21:07:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 21:07:41,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:41,403 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:07:41,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:07:41,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:41,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2024-11-11 21:07:41,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:41,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790654707] [2024-11-11 21:07:41,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 21:07:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:07:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 21:07:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:41,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790654707] [2024-11-11 21:07:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790654707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:41,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628875140] [2024-11-11 21:07:41,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:41,538 INFO L87 Difference]: Start difference. First operand 364 states and 492 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:07:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:41,666 INFO L93 Difference]: Finished difference Result 948 states and 1277 transitions. [2024-11-11 21:07:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:41,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2024-11-11 21:07:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:41,674 INFO L225 Difference]: With dead ends: 948 [2024-11-11 21:07:41,674 INFO L226 Difference]: Without dead ends: 592 [2024-11-11 21:07:41,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:41,681 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 84 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:41,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 327 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-11 21:07:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 554. [2024-11-11 21:07:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 489 states have (on average 1.296523517382413) internal successors, (634), 496 states have internal predecessors, (634), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2024-11-11 21:07:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 730 transitions. [2024-11-11 21:07:41,734 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 730 transitions. Word has length 61 [2024-11-11 21:07:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 730 transitions. [2024-11-11 21:07:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:07:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 730 transitions. [2024-11-11 21:07:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:07:41,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:41,738 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:07:41,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:07:41,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2024-11-11 21:07:41,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:41,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071189074] [2024-11-11 21:07:41,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 21:07:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:07:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:07:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071189074] [2024-11-11 21:07:41,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071189074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:41,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206670137] [2024-11-11 21:07:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:41,828 INFO L87 Difference]: Start difference. First operand 554 states and 730 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:07:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:41,952 INFO L93 Difference]: Finished difference Result 1207 states and 1583 transitions. [2024-11-11 21:07:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-11-11 21:07:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:41,959 INFO L225 Difference]: With dead ends: 1207 [2024-11-11 21:07:41,959 INFO L226 Difference]: Without dead ends: 753 [2024-11-11 21:07:41,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:41,962 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:41,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-11 21:07:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 698. [2024-11-11 21:07:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 617 states have (on average 1.2722852512155591) internal successors, (785), 626 states have internal predecessors, (785), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2024-11-11 21:07:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2024-11-11 21:07:42,006 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 66 [2024-11-11 21:07:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:42,007 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2024-11-11 21:07:42,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:07:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2024-11-11 21:07:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:07:42,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:42,013 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:07:42,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:07:42,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2024-11-11 21:07:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:42,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807208540] [2024-11-11 21:07:42,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 21:07:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:07:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:07:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:42,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807208540] [2024-11-11 21:07:42,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807208540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:42,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615907394] [2024-11-11 21:07:42,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:42,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:42,155 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 21:07:42,156 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 21:07:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 21:07:42,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:07:42,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615907394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:42,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-11 21:07:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954429358] [2024-11-11 21:07:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:42,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:07:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:07:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:42,311 INFO L87 Difference]: Start difference. First operand 698 states and 903 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:07:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:42,357 INFO L93 Difference]: Finished difference Result 1186 states and 1552 transitions. [2024-11-11 21:07:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-11 21:07:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:42,361 INFO L225 Difference]: With dead ends: 1186 [2024-11-11 21:07:42,361 INFO L226 Difference]: Without dead ends: 594 [2024-11-11 21:07:42,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 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 21:07:42,365 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 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 21:07:42,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-11 21:07:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 578. [2024-11-11 21:07:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 515 states have (on average 1.2621359223300972) internal successors, (650), 522 states have internal predecessors, (650), 36 states have call successors, (36), 23 states have call predecessors, (36), 26 states have return successors, (53), 32 states have call predecessors, (53), 34 states have call successors, (53) [2024-11-11 21:07:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 739 transitions. [2024-11-11 21:07:42,414 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 739 transitions. Word has length 67 [2024-11-11 21:07:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:42,415 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 739 transitions. [2024-11-11 21:07:42,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:07:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 739 transitions. [2024-11-11 21:07:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:07:42,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:42,417 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:07:42,435 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 21:07:42,621 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 21:07:42,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:42,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:42,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1145429959, now seen corresponding path program 1 times [2024-11-11 21:07:42,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574604747] [2024-11-11 21:07:42,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 21:07:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:07:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:07:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574604747] [2024-11-11 21:07:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574604747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124740131] [2024-11-11 21:07:42,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:42,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:42,769 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 21:07:42,770 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 21:07:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:42,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 21:07:42,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:07:42,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:07:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 21:07:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124740131] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:43,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 21:07:43,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 21:07:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163743274] [2024-11-11 21:07:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:43,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:07:43,034 INFO L87 Difference]: Start difference. First operand 578 states and 739 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:07:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:43,095 INFO L93 Difference]: Finished difference Result 633 states and 806 transitions. [2024-11-11 21:07:43,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:07:43,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2024-11-11 21:07:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:43,099 INFO L225 Difference]: With dead ends: 633 [2024-11-11 21:07:43,099 INFO L226 Difference]: Without dead ends: 630 [2024-11-11 21:07:43,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:43,101 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 171 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:43,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 183 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-11 21:07:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 577. [2024-11-11 21:07:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 515 states have (on average 1.258252427184466) internal successors, (648), 521 states have internal predecessors, (648), 35 states have call successors, (35), 23 states have call predecessors, (35), 26 states have return successors, (53), 32 states have call predecessors, (53), 34 states have call successors, (53) [2024-11-11 21:07:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2024-11-11 21:07:43,134 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 67 [2024-11-11 21:07:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:43,135 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2024-11-11 21:07:43,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:07:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2024-11-11 21:07:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:07:43,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:43,139 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:07:43,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:07:43,339 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 21:07:43,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1148913692, now seen corresponding path program 1 times [2024-11-11 21:07:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574518743] [2024-11-11 21:07:43,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:43,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 21:07:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:07:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:07:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574518743] [2024-11-11 21:07:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574518743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263176073] [2024-11-11 21:07:43,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:43,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:43,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:43,467 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 21:07:43,468 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 21:07:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:43,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 21:07:43,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:07:43,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:07:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 21:07:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263176073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:07:43,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:07:43,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 21:07:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831190018] [2024-11-11 21:07:43,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:07:43,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:07:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:07:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:07:43,951 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 21:07:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:44,532 INFO L93 Difference]: Finished difference Result 1977 states and 2546 transitions. [2024-11-11 21:07:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 21:07:44,533 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 68 [2024-11-11 21:07:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:44,540 INFO L225 Difference]: With dead ends: 1977 [2024-11-11 21:07:44,540 INFO L226 Difference]: Without dead ends: 1506 [2024-11-11 21:07:44,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 21:07:44,542 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 339 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:44,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1281 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:07:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-11 21:07:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 937. [2024-11-11 21:07:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 839 states have (on average 1.2455303933253874) internal successors, (1045), 851 states have internal predecessors, (1045), 54 states have call successors, (54), 36 states have call predecessors, (54), 43 states have return successors, (83), 49 states have call predecessors, (83), 53 states have call successors, (83) [2024-11-11 21:07:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1182 transitions. [2024-11-11 21:07:44,623 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1182 transitions. Word has length 68 [2024-11-11 21:07:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:44,624 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1182 transitions. [2024-11-11 21:07:44,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 21:07:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1182 transitions. [2024-11-11 21:07:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-11 21:07:44,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:44,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 21:07:44,645 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 21:07:44,832 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 21:07:44,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:44,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:44,833 INFO L85 PathProgramCache]: Analyzing trace with hash 892057432, now seen corresponding path program 1 times [2024-11-11 21:07:44,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592671055] [2024-11-11 21:07:44,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:44,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 21:07:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:07:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:07:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 21:07:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592671055] [2024-11-11 21:07:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592671055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368310311] [2024-11-11 21:07:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:44,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:44,904 INFO L87 Difference]: Start difference. First operand 937 states and 1182 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 21:07:45,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:45,009 INFO L93 Difference]: Finished difference Result 1664 states and 2098 transitions. [2024-11-11 21:07:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:45,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 87 [2024-11-11 21:07:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:45,014 INFO L225 Difference]: With dead ends: 1664 [2024-11-11 21:07:45,015 INFO L226 Difference]: Without dead ends: 903 [2024-11-11 21:07:45,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:45,018 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 119 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:45,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 257 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-11 21:07:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 815. [2024-11-11 21:07:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 730 states have (on average 1.236986301369863) internal successors, (903), 742 states have internal predecessors, (903), 47 states have call successors, (47), 31 states have call predecessors, (47), 37 states have return successors, (72), 41 states have call predecessors, (72), 46 states have call successors, (72) [2024-11-11 21:07:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1022 transitions. [2024-11-11 21:07:45,064 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1022 transitions. Word has length 87 [2024-11-11 21:07:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:45,065 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1022 transitions. [2024-11-11 21:07:45,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 21:07:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1022 transitions. [2024-11-11 21:07:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 21:07:45,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:45,069 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, 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] [2024-11-11 21:07:45,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:07:45,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash -265590444, now seen corresponding path program 1 times [2024-11-11 21:07:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409847379] [2024-11-11 21:07:45,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 21:07:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 21:07:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:07:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:07:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 21:07:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 21:07:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409847379] [2024-11-11 21:07:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409847379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468583710] [2024-11-11 21:07:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:45,167 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 21:07:45,169 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 21:07:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:45,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:07:45,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 21:07:45,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468583710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:45,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 21:07:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963408568] [2024-11-11 21:07:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:45,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:45,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:07:45,277 INFO L87 Difference]: Start difference. First operand 815 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 21:07:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:45,323 INFO L93 Difference]: Finished difference Result 1139 states and 1419 transitions. [2024-11-11 21:07:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 102 [2024-11-11 21:07:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:45,325 INFO L225 Difference]: With dead ends: 1139 [2024-11-11 21:07:45,325 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 21:07:45,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:07:45,328 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 203 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 21:07:45,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 203 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 21:07:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 21:07:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:07:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 21:07:45,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-11-11 21:07:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:45,330 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 21:07:45,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 21:07:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 21:07:45,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 21:07:45,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:07:45,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:07:45,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:45,540 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:45,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 21:07:47,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:07:47,914 WARN L156 FloydHoareUtils]: Requires clause for immediate_notify_threads contained old-variable. Original clause: (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (let ((.cse1 (= 2 |old(~c_dr_st~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0)) (.cse0 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse1) (and (= ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 1) (<= 2 |old(~p_dw_st~0)|) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse0 (= ~p_num_write~0 1))))) Eliminated clause: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse3 (= ~q_free~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse1 (= ~p_num_write~0 1)) (and (= ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0)))) [2024-11-11 21:07:47,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:07:47 BoogieIcfgContainer [2024-11-11 21:07:47,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:07:47,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:07:47,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:07:47,961 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:07:47,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:07:39" (3/4) ... [2024-11-11 21:07:47,964 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 21:07:47,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2024-11-11 21:07:47,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-11 21:07:47,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-11 21:07:47,975 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 21:07:47,977 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 21:07:47,977 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 21:07:47,977 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 21:07:48,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:07:48,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 21:07:48,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:07:48,105 INFO L158 Benchmark]: Toolchain (without parser) took 9042.84ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 77.8MB in the beginning and 167.7MB in the end (delta: -89.9MB). Peak memory consumption was 256.7kB. Max. memory is 16.1GB. [2024-11-11 21:07:48,105 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory was 102.4MB in the beginning and 102.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:07:48,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.16ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 63.3MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 21:07:48,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.73ms. Allocated memory is still 151.0MB. Free memory was 63.2MB in the beginning and 61.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:07:48,106 INFO L158 Benchmark]: Boogie Preprocessor took 45.16ms. Allocated memory is still 151.0MB. Free memory was 61.3MB in the beginning and 59.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:07:48,106 INFO L158 Benchmark]: RCFGBuilder took 419.52ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 59.0MB in the beginning and 157.4MB in the end (delta: -98.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-11 21:07:48,106 INFO L158 Benchmark]: TraceAbstraction took 8053.79ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 156.5MB in the beginning and 175.0MB in the end (delta: -18.6MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-11-11 21:07:48,106 INFO L158 Benchmark]: Witness Printer took 143.42ms. Allocated memory is still 239.1MB. Free memory was 175.0MB in the beginning and 167.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 21:07:48,109 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.18ms. Allocated memory is still 151.0MB. Free memory was 102.4MB in the beginning and 102.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.16ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 63.3MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.73ms. Allocated memory is still 151.0MB. Free memory was 63.2MB in the beginning and 61.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.16ms. Allocated memory is still 151.0MB. Free memory was 61.3MB in the beginning and 59.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.52ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 59.0MB in the beginning and 157.4MB in the end (delta: -98.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8053.79ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 156.5MB in the beginning and 175.0MB in the end (delta: -18.6MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 143.42ms. Allocated memory is still 239.1MB. Free memory was 175.0MB in the beginning and 167.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1198 mSDsluCounter, 3624 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2376 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 1248 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 934 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 1998 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 236/323 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 117]: Location Invariant Derived location invariant: ((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0))) || (((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0))) - InvariantResult [Line: 160]: Location Invariant Derived location invariant: ((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - ProcedureContractResult [Line: 76]: Procedure Contract for immediate_notify_threads Derived contract for procedure immediate_notify_threads. Requires: (((((c_dr_st == 2) && (c_dr_pc == 0)) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0))) || ((((((p_dw_pc == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_num_write == 1))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) Ensures: ((((((((((((p_num_write != 1) || (c_dr_pc != 0)) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st)))) || (p_dw_pc != 0)) || (p_last_write != q_buf_0)) || (c_num_read != 0)) || (q_free != 0)) && (((((c_dr_pc == 0) && (2 == \old(c_dr_st))) || ((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 == \old(c_dr_st)))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= \old(p_dw_st))) && (c_last_read == p_last_write))) || ((((((p_dw_pc == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_num_write == 1)))) && ((((((((c_dr_pc != 0) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st)))) || (p_last_write != q_buf_0)) || (c_num_read != p_num_write)) || (p_dw_st == 0)) || (q_free != 1)) || (c_last_read != p_last_write)) || (\old(p_dw_st) < 2))) && (((((((1 < p_dw_st) || (p_last_write != q_buf_0)) || (c_num_read != p_num_write)) || (p_dw_st == 0)) || (q_free != 1)) || (c_last_read != p_last_write)) || (\old(p_dw_st) < 2))) && (((c_dr_st == 2) || (2 != \old(c_dr_st))) || (c_dr_pc != 0))) && (((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t)))) - ProcedureContractResult [Line: 220]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) Ensures: (((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) && (((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t)))) - ProcedureContractResult [Line: 15]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: (0 && (((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 21:07:48,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE