./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.dd.update-z3-fca748b-m [2024-11-19 22:19:49,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:19:49,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:19:49,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:19:49,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:19:49,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:19:49,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:19:49,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:19:49,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:19:49,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:19:49,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:19:49,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:19:49,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:19:49,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:19:49,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:19:49,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:19:49,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:19:49,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:19:49,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:19:49,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:19:49,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:19:49,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:19:49,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:19:49,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:19:49,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:19:49,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:19:49,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:19:49,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:19:49,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:19:49,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:19:49,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:19:49,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:19:49,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:19:49,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:19:49,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:19:49,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:19:49,353 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-19 22:19:49,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:19:49,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:19:49,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:19:49,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:19:49,563 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:19:49,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-19 22:19:50,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:19:50,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:19:50,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-19 22:19:50,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cb3c134/b05b8a0af6754249b694c9a3647e86f6/FLAGfc6e051c3 [2024-11-19 22:19:51,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cb3c134/b05b8a0af6754249b694c9a3647e86f6 [2024-11-19 22:19:51,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:19:51,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:19:51,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:19:51,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:19:51,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:19:51,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec486ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51, skipping insertion in model container [2024-11-19 22:19:51,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:19:51,597 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-19 22:19:51,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:19:51,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:19:51,676 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-19 22:19:51,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:19:51,716 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:19:51,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51 WrapperNode [2024-11-19 22:19:51,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:19:51,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:19:51,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:19:51,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:19:51,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,748 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 204 [2024-11-19 22:19:51,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:19:51,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:19:51,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:19:51,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:19:51,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,780 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-19 22:19:51,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:19:51,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:19:51,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:19:51,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:19:51,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (1/1) ... [2024-11-19 22:19:51,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:19:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:19:51,828 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-19 22:19:51,830 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-19 22:19:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:19:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 22:19:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 22:19:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:19:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-19 22:19:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-19 22:19:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-19 22:19:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-19 22:19:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:19:51,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:19:51,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:19:51,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:19:52,242 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-19 22:19:52,243 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:19:52,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:19:52,263 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 22:19:52,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:52 BoogieIcfgContainer [2024-11-19 22:19:52,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:19:52,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:19:52,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:19:52,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:19:52,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:19:51" (1/3) ... [2024-11-19 22:19:52,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4941070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:52, skipping insertion in model container [2024-11-19 22:19:52,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:51" (2/3) ... [2024-11-19 22:19:52,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4941070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:52, skipping insertion in model container [2024-11-19 22:19:52,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:52" (3/3) ... [2024-11-19 22:19:52,274 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-11-19 22:19:52,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:19:52,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:19:52,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:19:52,365 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;@33e99768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:19:52,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:19:52,369 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-19 22:19:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 22:19:52,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:52,376 INFO L215 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-19 22:19:52,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:52,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2024-11-19 22:19:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558999642] [2024-11-19 22:19:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:19:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:52,693 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-19 22:19:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558999642] [2024-11-19 22:19:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558999642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:52,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:52,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:19:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073475690] [2024-11-19 22:19:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:52,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:52,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:19:52,730 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-19 22:19:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:52,967 INFO L93 Difference]: Finished difference Result 214 states and 325 transitions. [2024-11-19 22:19:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:52,970 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-19 22:19:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:52,982 INFO L225 Difference]: With dead ends: 214 [2024-11-19 22:19:52,983 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 22:19:52,987 INFO L431 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-19 22:19:52,992 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:19:52,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 260 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:19:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 22:19:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-11-19 22:19:53,042 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-19 22:19:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2024-11-19 22:19:53,046 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 43 [2024-11-19 22:19:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2024-11-19 22:19:53,047 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-19 22:19:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2024-11-19 22:19:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:19:53,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:53,050 INFO L215 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-19 22:19:53,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:19:53,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:53,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2024-11-19 22:19:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:53,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865998023] [2024-11-19 22:19:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:19:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,169 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-19 22:19:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:53,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865998023] [2024-11-19 22:19:53,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865998023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:53,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:53,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:19:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623742130] [2024-11-19 22:19:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:53,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:19:53,173 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-19 22:19:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:53,302 INFO L93 Difference]: Finished difference Result 380 states and 524 transitions. [2024-11-19 22:19:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:53,303 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-19 22:19:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:53,305 INFO L225 Difference]: With dead ends: 380 [2024-11-19 22:19:53,308 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 22:19:53,309 INFO L431 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-19 22:19:53,310 INFO L432 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-19 22:19:53,311 INFO L433 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-19 22:19:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 22:19:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2024-11-19 22:19:53,334 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-19 22:19:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2024-11-19 22:19:53,336 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 274 transitions. Word has length 44 [2024-11-19 22:19:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 274 transitions. [2024-11-19 22:19:53,337 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-19 22:19:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 274 transitions. [2024-11-19 22:19:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:19:53,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:53,339 INFO L215 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-19 22:19:53,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:19:53,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2024-11-19 22:19:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379217238] [2024-11-19 22:19:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:19:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,416 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-19 22:19:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379217238] [2024-11-19 22:19:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379217238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:53,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:19:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118982084] [2024-11-19 22:19:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:53,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:19:53,422 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-19 22:19:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:53,541 INFO L93 Difference]: Finished difference Result 607 states and 833 transitions. [2024-11-19 22:19:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:53,542 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-19 22:19:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:53,545 INFO L225 Difference]: With dead ends: 607 [2024-11-19 22:19:53,547 INFO L226 Difference]: Without dead ends: 416 [2024-11-19 22:19:53,549 INFO L431 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-19 22:19:53,549 INFO L432 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-19 22:19:53,550 INFO L433 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-19 22:19:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-19 22:19:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 364. [2024-11-19 22:19:53,580 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-19 22:19:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 492 transitions. [2024-11-19 22:19:53,583 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 492 transitions. Word has length 44 [2024-11-19 22:19:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:53,583 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 492 transitions. [2024-11-19 22:19:53,583 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-19 22:19:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2024-11-19 22:19:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 22:19:53,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:53,587 INFO L215 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-19 22:19:53,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:19:53,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:53,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2024-11-19 22:19:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:53,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654519862] [2024-11-19 22:19:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:53,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-19 22:19:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 22:19:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,684 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-19 22:19:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654519862] [2024-11-19 22:19:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654519862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:53,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:19:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122794367] [2024-11-19 22:19:53,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:53,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:19:53,690 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-19 22:19:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:53,785 INFO L93 Difference]: Finished difference Result 948 states and 1277 transitions. [2024-11-19 22:19:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:53,786 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-19 22:19:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:53,789 INFO L225 Difference]: With dead ends: 948 [2024-11-19 22:19:53,789 INFO L226 Difference]: Without dead ends: 592 [2024-11-19 22:19:53,790 INFO L431 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-19 22:19:53,791 INFO L432 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-19 22:19:53,791 INFO L433 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-19 22:19:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-19 22:19:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 554. [2024-11-19 22:19:53,818 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-19 22:19:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 730 transitions. [2024-11-19 22:19:53,822 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 730 transitions. Word has length 61 [2024-11-19 22:19:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:53,824 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 730 transitions. [2024-11-19 22:19:53,824 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-19 22:19:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 730 transitions. [2024-11-19 22:19:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:19:53,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:53,829 INFO L215 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-19 22:19:53,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:19:53,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:53,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2024-11-19 22:19:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:53,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865935849] [2024-11-19 22:19:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 22:19:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 22:19:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:53,903 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-19 22:19:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:53,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865935849] [2024-11-19 22:19:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865935849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:53,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:19:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64261305] [2024-11-19 22:19:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:53,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:53,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:19:53,909 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-19 22:19:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:54,006 INFO L93 Difference]: Finished difference Result 1207 states and 1583 transitions. [2024-11-19 22:19:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:54,007 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-19 22:19:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:54,012 INFO L225 Difference]: With dead ends: 1207 [2024-11-19 22:19:54,013 INFO L226 Difference]: Without dead ends: 753 [2024-11-19 22:19:54,014 INFO L431 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-19 22:19:54,028 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 22:19:54,031 INFO L433 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-19 22:19:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-19 22:19:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 698. [2024-11-19 22:19:54,064 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-19 22:19:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2024-11-19 22:19:54,068 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 66 [2024-11-19 22:19:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:54,069 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2024-11-19 22:19:54,069 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-19 22:19:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2024-11-19 22:19:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:19:54,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:54,071 INFO L215 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-19 22:19:54,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:19:54,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2024-11-19 22:19:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603365951] [2024-11-19 22:19:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:19:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:19:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,181 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-19 22:19:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:54,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603365951] [2024-11-19 22:19:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603365951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:19:54,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879286767] [2024-11-19 22:19:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:54,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:19:54,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:19:54,184 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-19 22:19:54,185 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-19 22:19:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 22:19:54,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:19:54,321 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-19 22:19:54,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:19:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879286767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:19:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-19 22:19:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120081056] [2024-11-19 22:19:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:54,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:19:54,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:19:54,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:19:54,325 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-19 22:19:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:54,363 INFO L93 Difference]: Finished difference Result 1186 states and 1552 transitions. [2024-11-19 22:19:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:54,364 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-19 22:19:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:54,367 INFO L225 Difference]: With dead ends: 1186 [2024-11-19 22:19:54,368 INFO L226 Difference]: Without dead ends: 594 [2024-11-19 22:19:54,370 INFO L431 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-19 22:19:54,372 INFO L432 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-19 22:19:54,373 INFO L433 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-19 22:19:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-19 22:19:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 578. [2024-11-19 22:19:54,397 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-19 22:19:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 739 transitions. [2024-11-19 22:19:54,401 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 739 transitions. Word has length 67 [2024-11-19 22:19:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:54,401 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 739 transitions. [2024-11-19 22:19:54,401 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-19 22:19:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 739 transitions. [2024-11-19 22:19:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:19:54,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:54,403 INFO L215 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-19 22:19:54,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:19:54,604 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-19 22:19:54,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:54,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1145429959, now seen corresponding path program 1 times [2024-11-19 22:19:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898831935] [2024-11-19 22:19:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:19:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:19:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,713 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-19 22:19:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898831935] [2024-11-19 22:19:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898831935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:19:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248593791] [2024-11-19 22:19:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:54,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:19:54,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:19:54,716 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-19 22:19:54,717 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-19 22:19:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:54,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 22:19:54,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:19:54,847 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-19 22:19:54,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:19:54,895 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-19 22:19:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248593791] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 22:19:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:19:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-19 22:19:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706127745] [2024-11-19 22:19:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:54,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:19:54,897 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-19 22:19:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:54,959 INFO L93 Difference]: Finished difference Result 633 states and 806 transitions. [2024-11-19 22:19:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:19:54,960 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-19 22:19:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:54,962 INFO L225 Difference]: With dead ends: 633 [2024-11-19 22:19:54,964 INFO L226 Difference]: Without dead ends: 630 [2024-11-19 22:19:54,964 INFO L431 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-19 22:19:54,965 INFO L432 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-19 22:19:54,965 INFO L433 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-19 22:19:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-19 22:19:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 577. [2024-11-19 22:19:55,006 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-19 22:19:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2024-11-19 22:19:55,008 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 67 [2024-11-19 22:19:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:55,009 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2024-11-19 22:19:55,009 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-19 22:19:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2024-11-19 22:19:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:19:55,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:55,011 INFO L215 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-19 22:19:55,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 22:19:55,213 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-19 22:19:55,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:55,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:55,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1148913692, now seen corresponding path program 1 times [2024-11-19 22:19:55,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:55,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443150549] [2024-11-19 22:19:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:19:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:19:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:55,298 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-19 22:19:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443150549] [2024-11-19 22:19:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443150549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:19:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224102702] [2024-11-19 22:19:55,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:19:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:19:55,302 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-19 22:19:55,303 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-19 22:19:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:55,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 22:19:55,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:19:55,598 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-19 22:19:55,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:19:55,664 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-19 22:19:55,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224102702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:19:55,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:19:55,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-19 22:19:55,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725152755] [2024-11-19 22:19:55,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:19:55,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:19:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:55,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:19:55,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:19:55,668 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-19 22:19:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:56,167 INFO L93 Difference]: Finished difference Result 1977 states and 2546 transitions. [2024-11-19 22:19:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 22:19:56,168 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-19 22:19:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:56,174 INFO L225 Difference]: With dead ends: 1977 [2024-11-19 22:19:56,174 INFO L226 Difference]: Without dead ends: 1506 [2024-11-19 22:19:56,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-19 22:19:56,176 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:19:56,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1281 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:19:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-19 22:19:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 937. [2024-11-19 22:19:56,219 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-19 22:19:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1182 transitions. [2024-11-19 22:19:56,224 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1182 transitions. Word has length 68 [2024-11-19 22:19:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:56,224 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1182 transitions. [2024-11-19 22:19:56,224 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-19 22:19:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1182 transitions. [2024-11-19 22:19:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 22:19:56,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:56,229 INFO L215 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-19 22:19:56,237 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-19 22:19:56,433 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-19 22:19:56,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:56,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 892057432, now seen corresponding path program 1 times [2024-11-19 22:19:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369618939] [2024-11-19 22:19:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:19:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 22:19:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 22:19:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,497 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-19 22:19:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369618939] [2024-11-19 22:19:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369618939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:56,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:19:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927516121] [2024-11-19 22:19:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:56,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:19:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:56,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:19:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:19:56,500 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-19 22:19:56,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:56,594 INFO L93 Difference]: Finished difference Result 1664 states and 2098 transitions. [2024-11-19 22:19:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:19:56,595 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-19 22:19:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:56,598 INFO L225 Difference]: With dead ends: 1664 [2024-11-19 22:19:56,599 INFO L226 Difference]: Without dead ends: 903 [2024-11-19 22:19:56,600 INFO L431 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-19 22:19:56,602 INFO L432 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-19 22:19:56,602 INFO L433 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-19 22:19:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-19 22:19:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 815. [2024-11-19 22:19:56,634 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-19 22:19:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1022 transitions. [2024-11-19 22:19:56,638 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1022 transitions. Word has length 87 [2024-11-19 22:19:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:56,639 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1022 transitions. [2024-11-19 22:19:56,639 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-19 22:19:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1022 transitions. [2024-11-19 22:19:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 22:19:56,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:56,641 INFO L215 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-19 22:19:56,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:19:56,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash -265590444, now seen corresponding path program 1 times [2024-11-19 22:19:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136894983] [2024-11-19 22:19:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:19:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:19:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 22:19:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 22:19:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 22:19:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,750 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-19 22:19:56,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136894983] [2024-11-19 22:19:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136894983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:19:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782142515] [2024-11-19 22:19:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:56,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:19:56,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:19:56,753 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-19 22:19:56,753 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-19 22:19:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:19:56,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:19:56,831 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-19 22:19:56,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:19:56,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782142515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:56,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:19:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 22:19:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385948752] [2024-11-19 22:19:56,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:56,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:19:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:19:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:19:56,834 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-19 22:19:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:56,864 INFO L93 Difference]: Finished difference Result 1139 states and 1419 transitions. [2024-11-19 22:19:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:19:56,864 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-19 22:19:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:56,865 INFO L225 Difference]: With dead ends: 1139 [2024-11-19 22:19:56,865 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:19:56,867 INFO L431 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-19 22:19:56,867 INFO L432 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-19 22:19:56,867 INFO L433 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-19 22:19:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:19:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:19:56,868 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-19 22:19:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:19:56,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-11-19 22:19:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:56,869 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:19:56,869 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-19 22:19:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:19:56,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:19:56,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:19:56,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 22:19:57,075 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-19 22:19:57,078 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:19:57,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:19:58,899 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:19:58,928 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-19 22:19:58,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:19:58 BoogieIcfgContainer [2024-11-19 22:19:58,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:19:58,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:19:58,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:19:58,957 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:19:58,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:52" (3/4) ... [2024-11-19 22:19:58,959 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 22:19:58,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2024-11-19 22:19:58,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-19 22:19:58,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-19 22:19:58,970 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 22:19:58,971 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 22:19:58,971 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 22:19:58,971 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:19:59,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:19:59,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 22:19:59,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:19:59,053 INFO L158 Benchmark]: Toolchain (without parser) took 7656.37ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 86.6MB in the beginning and 187.4MB in the end (delta: -100.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,053 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:19:59,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.14ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 72.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.96ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,054 INFO L158 Benchmark]: Boogie Preprocessor took 47.87ms. Allocated memory is still 159.4MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,054 INFO L158 Benchmark]: RCFGBuilder took 466.92ms. Allocated memory is still 159.4MB. Free memory was 67.8MB in the beginning and 126.5MB in the end (delta: -58.7MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,054 INFO L158 Benchmark]: TraceAbstraction took 6689.41ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 125.6MB in the beginning and 194.7MB in the end (delta: -69.1MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,054 INFO L158 Benchmark]: Witness Printer took 96.02ms. Allocated memory is still 285.2MB. Free memory was 194.7MB in the beginning and 187.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 22:19:59,055 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.15ms. Allocated memory is still 159.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.14ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 72.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.96ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.87ms. Allocated memory is still 159.4MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.92ms. Allocated memory is still 159.4MB. Free memory was 67.8MB in the beginning and 126.5MB in the end (delta: -58.7MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6689.41ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 125.6MB in the beginning and 194.7MB in the end (delta: -69.1MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. * Witness Printer took 96.02ms. Allocated memory is still 285.2MB. Free memory was 194.7MB in the beginning and 187.4MB 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: 4.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1198 mSDsluCounter, 3624 SdHoareTripleChecker+Invalid, 0.6s 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.4s 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 934 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s 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-19 22:19:59,071 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