./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:07:02,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:07:02,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:07:02,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:07:02,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:07:02,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:07:02,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:07:02,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:07:02,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:07:02,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:07:02,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:07:02,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:07:02,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:07:02,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:07:02,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:07:02,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:07:02,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:07:02,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:07:02,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:07:02,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:07:02,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:07:02,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:07:02,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:07:02,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:07:02,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:07:02,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:07:02,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:07:02,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:07:02,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:07:02,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:07:02,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:07:02,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:07:02,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:07:02,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:07:02,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:07:02,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:07:02,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:07:02,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:07:02,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:07:02,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:07:02,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:07:02,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:07:02,153 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-16 08:07:02,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:07:02,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:07:02,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:07:02,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:07:02,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:07:02,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-16 08:07:03,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:07:04,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:07:04,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-16 08:07:04,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16456d944/97c709377d6c4e8fa66dae23abf247ad/FLAGce5f59ffc [2024-11-16 08:07:04,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16456d944/97c709377d6c4e8fa66dae23abf247ad [2024-11-16 08:07:04,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:07:04,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:07:04,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:07:04,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:07:04,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:07:04,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f7e581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04, skipping insertion in model container [2024-11-16 08:07:04,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:07:04,659 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-16 08:07:04,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:07:04,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:07:04,720 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-16 08:07:04,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:07:04,755 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:07:04,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04 WrapperNode [2024-11-16 08:07:04,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:07:04,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:07:04,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:07:04,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:07:04,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,799 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 200 [2024-11-16 08:07:04,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:07:04,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:07:04,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:07:04,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:07:04,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,822 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-16 08:07:04,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:07:04,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:07:04,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:07:04,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:07:04,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (1/1) ... [2024-11-16 08:07:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:07:04,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:07:04,872 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-16 08:07:04,888 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-16 08:07:04,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:07:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-16 08:07:04,935 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-16 08:07:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:07:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-16 08:07:04,935 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-16 08:07:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-16 08:07:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-16 08:07:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:07:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:07:05,028 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:07:05,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:07:05,366 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-16 08:07:05,366 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:07:05,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:07:05,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:07:05,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:07:05 BoogieIcfgContainer [2024-11-16 08:07:05,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:07:05,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:07:05,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:07:05,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:07:05,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:07:04" (1/3) ... [2024-11-16 08:07:05,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f9464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:07:05, skipping insertion in model container [2024-11-16 08:07:05,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:07:04" (2/3) ... [2024-11-16 08:07:05,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f9464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:07:05, skipping insertion in model container [2024-11-16 08:07:05,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:07:05" (3/3) ... [2024-11-16 08:07:05,427 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-11-16 08:07:05,443 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:07:05,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:07:05,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:07:05,515 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;@484ac7bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:07:05,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:07:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 84 states have internal predecessors, (115), 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-16 08:07:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 08:07:05,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:05,526 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, 1, 1, 1] [2024-11-16 08:07:05,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:05,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1790370331, now seen corresponding path program 1 times [2024-11-16 08:07:05,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:05,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672298723] [2024-11-16 08:07:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 08:07:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:05,830 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-16 08:07:05,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:05,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672298723] [2024-11-16 08:07:05,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672298723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:05,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:07:05,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:07:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347739283] [2024-11-16 08:07:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:07:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:05,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:07:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:07:05,867 INFO L87 Difference]: Start difference. First operand has 92 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 84 states have internal predecessors, (115), 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 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-16 08:07:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:06,068 INFO L93 Difference]: Finished difference Result 259 states and 370 transitions. [2024-11-16 08:07:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:07:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 47 [2024-11-16 08:07:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:06,083 INFO L225 Difference]: With dead ends: 259 [2024-11-16 08:07:06,083 INFO L226 Difference]: Without dead ends: 163 [2024-11-16 08:07:06,086 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-16 08:07:06,088 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 114 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:06,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 305 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:07:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-16 08:07:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2024-11-16 08:07:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 142 states have internal predecessors, (184), 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-16 08:07:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 208 transitions. [2024-11-16 08:07:06,137 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 208 transitions. Word has length 47 [2024-11-16 08:07:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:06,139 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 208 transitions. [2024-11-16 08:07:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-16 08:07:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 208 transitions. [2024-11-16 08:07:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 08:07:06,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:06,143 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, 1, 1, 1, 1] [2024-11-16 08:07:06,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:07:06,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:06,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1114393228, now seen corresponding path program 1 times [2024-11-16 08:07:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:06,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211173052] [2024-11-16 08:07:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:07:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,275 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-16 08:07:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211173052] [2024-11-16 08:07:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211173052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:07:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:07:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17915176] [2024-11-16 08:07:06,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:06,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:07:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:06,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:07:06,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:07:06,280 INFO L87 Difference]: Start difference. First operand 156 states and 208 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-16 08:07:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:06,440 INFO L93 Difference]: Finished difference Result 462 states and 624 transitions. [2024-11-16 08:07:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:07:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 48 [2024-11-16 08:07:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:06,445 INFO L225 Difference]: With dead ends: 462 [2024-11-16 08:07:06,446 INFO L226 Difference]: Without dead ends: 314 [2024-11-16 08:07:06,447 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-16 08:07:06,448 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 130 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:06,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 264 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:07:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-16 08:07:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2024-11-16 08:07:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 259 states have (on average 1.2895752895752897) internal successors, (334), 262 states have internal predecessors, (334), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (28), 16 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-16 08:07:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 380 transitions. [2024-11-16 08:07:06,503 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 380 transitions. Word has length 48 [2024-11-16 08:07:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:06,504 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 380 transitions. [2024-11-16 08:07:06,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-16 08:07:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 380 transitions. [2024-11-16 08:07:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 08:07:06,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:06,510 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:07:06,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:06,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 114664899, now seen corresponding path program 1 times [2024-11-16 08:07:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:06,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098311083] [2024-11-16 08:07:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:06,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 08:07:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,626 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-16 08:07:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098311083] [2024-11-16 08:07:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098311083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:06,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:07:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:07:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333133161] [2024-11-16 08:07:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:07:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:07:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:07:06,628 INFO L87 Difference]: Start difference. First operand 288 states and 380 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, (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-16 08:07:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:06,759 INFO L93 Difference]: Finished difference Result 841 states and 1094 transitions. [2024-11-16 08:07:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:07:06,760 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, (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 51 [2024-11-16 08:07:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:06,765 INFO L225 Difference]: With dead ends: 841 [2024-11-16 08:07:06,765 INFO L226 Difference]: Without dead ends: 561 [2024-11-16 08:07:06,767 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-16 08:07:06,769 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 108 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:06,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 312 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:07:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-16 08:07:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 433. [2024-11-16 08:07:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 392 states have (on average 1.2831632653061225) internal successors, (503), 397 states have internal predecessors, (503), 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-16 08:07:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 561 transitions. [2024-11-16 08:07:06,826 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 561 transitions. Word has length 51 [2024-11-16 08:07:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:06,826 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 561 transitions. [2024-11-16 08:07:06,827 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, (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-16 08:07:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 561 transitions. [2024-11-16 08:07:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:07:06,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:06,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:07:06,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1221285005, now seen corresponding path program 1 times [2024-11-16 08:07:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662228674] [2024-11-16 08:07:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 08:07:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 08:07:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 08:07:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662228674] [2024-11-16 08:07:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662228674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:07:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:07:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035093612] [2024-11-16 08:07:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:07:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:07:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:07:06,968 INFO L87 Difference]: Start difference. First operand 433 states and 561 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-16 08:07:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:07,103 INFO L93 Difference]: Finished difference Result 1123 states and 1452 transitions. [2024-11-16 08:07:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:07:07,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 71 [2024-11-16 08:07:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:07,111 INFO L225 Difference]: With dead ends: 1123 [2024-11-16 08:07:07,112 INFO L226 Difference]: Without dead ends: 698 [2024-11-16 08:07:07,113 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-16 08:07:07,117 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 92 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:07,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 383 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:07:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-16 08:07:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 660. [2024-11-16 08:07:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 595 states have (on average 1.2436974789915967) internal successors, (740), 602 states have internal predecessors, (740), 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-16 08:07:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 836 transitions. [2024-11-16 08:07:07,169 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 836 transitions. Word has length 71 [2024-11-16 08:07:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 836 transitions. [2024-11-16 08:07:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-16 08:07:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 836 transitions. [2024-11-16 08:07:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 08:07:07,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:07,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:07:07,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:07,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash 384695365, now seen corresponding path program 1 times [2024-11-16 08:07:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952994901] [2024-11-16 08:07:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 08:07:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 08:07:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,267 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-16 08:07:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:07,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952994901] [2024-11-16 08:07:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952994901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:07,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:07:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:07:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817857985] [2024-11-16 08:07:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:07:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:07:07,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:07:07,274 INFO L87 Difference]: Start difference. First operand 660 states and 836 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-16 08:07:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:07,409 INFO L93 Difference]: Finished difference Result 1430 states and 1806 transitions. [2024-11-16 08:07:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:07:07,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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 77 [2024-11-16 08:07:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:07,416 INFO L225 Difference]: With dead ends: 1430 [2024-11-16 08:07:07,417 INFO L226 Difference]: Without dead ends: 888 [2024-11-16 08:07:07,419 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-16 08:07:07,421 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 113 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:07,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 281 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:07:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-16 08:07:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 833. [2024-11-16 08:07:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 752 states have (on average 1.2234042553191489) internal successors, (920), 761 states have internal predecessors, (920), 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-16 08:07:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1038 transitions. [2024-11-16 08:07:07,495 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1038 transitions. Word has length 77 [2024-11-16 08:07:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:07,496 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1038 transitions. [2024-11-16 08:07:07,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-16 08:07:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1038 transitions. [2024-11-16 08:07:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 08:07:07,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:07,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:07:07,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1012457187, now seen corresponding path program 1 times [2024-11-16 08:07:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020751160] [2024-11-16 08:07:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:07:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 08:07:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 08:07:07,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:07,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020751160] [2024-11-16 08:07:07,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020751160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:07:07,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371119102] [2024-11-16 08:07:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:07,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:07:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:07:07,702 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-16 08:07:07,705 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-16 08:07:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:07,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 08:07:07,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:07:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:07:07,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:07:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 08:07:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371119102] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 08:07:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 08:07:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-16 08:07:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335197431] [2024-11-16 08:07:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:08,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:07:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:08,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:07:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:07:08,018 INFO L87 Difference]: Start difference. First operand 833 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-16 08:07:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:08,091 INFO L93 Difference]: Finished difference Result 907 states and 1124 transitions. [2024-11-16 08:07:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:07:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 80 [2024-11-16 08:07:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:08,097 INFO L225 Difference]: With dead ends: 907 [2024-11-16 08:07:08,098 INFO L226 Difference]: Without dead ends: 903 [2024-11-16 08:07:08,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 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-16 08:07:08,099 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 200 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 212 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-16 08:07:08,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 212 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:07:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-16 08:07:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 832. [2024-11-16 08:07:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 752 states have (on average 1.2207446808510638) internal successors, (918), 760 states have internal predecessors, (918), 45 states have call successors, (45), 29 states have call predecessors, (45), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2024-11-16 08:07:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1035 transitions. [2024-11-16 08:07:08,151 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1035 transitions. Word has length 80 [2024-11-16 08:07:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:08,152 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1035 transitions. [2024-11-16 08:07:08,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-16 08:07:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1035 transitions. [2024-11-16 08:07:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 08:07:08,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:08,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:08,172 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-16 08:07:08,354 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-16 08:07:08,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:08,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1324972625, now seen corresponding path program 1 times [2024-11-16 08:07:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:08,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496091017] [2024-11-16 08:07:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:07:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 08:07:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 08:07:08,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496091017] [2024-11-16 08:07:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496091017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:07:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615234807] [2024-11-16 08:07:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:07:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:07:08,478 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-16 08:07:08,479 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-16 08:07:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:08,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 08:07:08,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:07:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:07:08,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:07:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 08:07:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615234807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:07:08,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:07:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-16 08:07:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781846592] [2024-11-16 08:07:08,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:07:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 08:07:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:08,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 08:07:08,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:07:08,988 INFO L87 Difference]: Start difference. First operand 832 states and 1035 transitions. Second operand has 11 states, 11 states have (on average 17.0) internal successors, (187), 10 states have internal predecessors, (187), 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-16 08:07:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:09,625 INFO L93 Difference]: Finished difference Result 2629 states and 3313 transitions. [2024-11-16 08:07:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 08:07:09,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.0) internal successors, (187), 10 states have internal predecessors, (187), 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 81 [2024-11-16 08:07:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:09,654 INFO L225 Difference]: With dead ends: 2629 [2024-11-16 08:07:09,654 INFO L226 Difference]: Without dead ends: 1988 [2024-11-16 08:07:09,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-16 08:07:09,658 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 408 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:09,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1491 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 08:07:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2024-11-16 08:07:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1254. [2024-11-16 08:07:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1135 states have (on average 1.213215859030837) internal successors, (1377), 1151 states have internal predecessors, (1377), 65 states have call successors, (65), 43 states have call predecessors, (65), 53 states have return successors, (106), 59 states have call predecessors, (106), 64 states have call successors, (106) [2024-11-16 08:07:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1548 transitions. [2024-11-16 08:07:09,732 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1548 transitions. Word has length 81 [2024-11-16 08:07:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1548 transitions. [2024-11-16 08:07:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.0) internal successors, (187), 10 states have internal predecessors, (187), 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-16 08:07:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1548 transitions. [2024-11-16 08:07:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 08:07:09,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:09,737 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:09,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 08:07:09,941 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-16 08:07:09,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1690709826, now seen corresponding path program 1 times [2024-11-16 08:07:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942817299] [2024-11-16 08:07:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:07:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 08:07:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 08:07:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-16 08:07:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942817299] [2024-11-16 08:07:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942817299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:07:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785062354] [2024-11-16 08:07:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:10,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:07:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:07:10,049 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-16 08:07:10,052 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-16 08:07:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:07:10,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:07:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 08:07:10,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:07:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785062354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:10,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:07:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 08:07:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189293135] [2024-11-16 08:07:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:10,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:07:10,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:10,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:07:10,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:07:10,171 INFO L87 Difference]: Start difference. First operand 1254 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 08:07:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:10,223 INFO L93 Difference]: Finished difference Result 2076 states and 2577 transitions. [2024-11-16 08:07:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:07:10,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 102 [2024-11-16 08:07:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:10,228 INFO L225 Difference]: With dead ends: 2076 [2024-11-16 08:07:10,228 INFO L226 Difference]: Without dead ends: 1116 [2024-11-16 08:07:10,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:07:10,231 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:07:10,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 235 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:07:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-16 08:07:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1083. [2024-11-16 08:07:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 980 states have (on average 1.2091836734693877) internal successors, (1185), 995 states have internal predecessors, (1185), 57 states have call successors, (57), 37 states have call predecessors, (57), 45 states have return successors, (92), 50 states have call predecessors, (92), 56 states have call successors, (92) [2024-11-16 08:07:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1334 transitions. [2024-11-16 08:07:10,312 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1334 transitions. Word has length 102 [2024-11-16 08:07:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:10,313 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1334 transitions. [2024-11-16 08:07:10,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 08:07:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1334 transitions. [2024-11-16 08:07:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 08:07:10,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:07:10,316 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 08:07:10,335 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-16 08:07:10,516 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-16 08:07:10,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:07:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:07:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1686944952, now seen corresponding path program 1 times [2024-11-16 08:07:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:07:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939552069] [2024-11-16 08:07:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:07:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 08:07:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:07:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 08:07:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 08:07:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 08:07:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-16 08:07:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:07:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939552069] [2024-11-16 08:07:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939552069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:07:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373008490] [2024-11-16 08:07:10,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:07:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:07:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:07:10,621 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-16 08:07:10,622 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-16 08:07:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:07:10,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:07:10,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:07:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 08:07:10,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:07:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373008490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:07:10,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:07:10,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 08:07:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273692569] [2024-11-16 08:07:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:07:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:07:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:07:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:07:10,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:07:10,749 INFO L87 Difference]: Start difference. First operand 1083 states and 1334 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-16 08:07:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:07:10,792 INFO L93 Difference]: Finished difference Result 1539 states and 1879 transitions. [2024-11-16 08:07:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:07:10,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 121 [2024-11-16 08:07:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:07:10,794 INFO L225 Difference]: With dead ends: 1539 [2024-11-16 08:07:10,794 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 08:07:10,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:07:10,798 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 239 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-16 08:07:10,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 239 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:07:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 08:07:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 08:07:10,800 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-16 08:07:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 08:07:10,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-11-16 08:07:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:07:10,801 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 08:07:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-16 08:07:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 08:07:10,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 08:07:10,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:07:10,823 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-16 08:07:11,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:07:11,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:07:11,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 08:07:13,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:07:13,115 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 ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 (= 2 |old(~c_dr_st~0)|)) (and (= ~c_num_read~0 ~p_num_write~0) .cse0 (= ~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) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~p_num_write~0 1))))) Eliminated clause: (let ((.cse1 (= ~q_free~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (= ~c_dr_st~0 2) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~p_num_write~0 1)) (and (= ~c_num_read~0 ~p_num_write~0) .cse0 (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0)))) [2024-11-16 08:07:13,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:07:13 BoogieIcfgContainer [2024-11-16 08:07:13,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:07:13,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:07:13,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:07:13,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:07:13,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:07:05" (3/4) ... [2024-11-16 08:07:13,170 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 08:07:13,175 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2024-11-16 08:07:13,175 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-16 08:07:13,176 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2024-11-16 08:07:13,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-16 08:07:13,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 08:07:13,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 08:07:13,182 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 08:07:13,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:07:13,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 08:07:13,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:07:13,294 INFO L158 Benchmark]: Toolchain (without parser) took 8822.57ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 145.8MB in the beginning and 155.9MB in the end (delta: -10.1MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,294 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:07:13,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.73ms. Allocated memory is still 182.5MB. Free memory was 145.8MB in the beginning and 132.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.04ms. Allocated memory is still 182.5MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,295 INFO L158 Benchmark]: Boogie Preprocessor took 32.14ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 128.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,295 INFO L158 Benchmark]: IcfgBuilder took 562.63ms. Allocated memory is still 182.5MB. Free memory was 128.0MB in the beginning and 151.8MB in the end (delta: -23.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,295 INFO L158 Benchmark]: TraceAbstraction took 7761.81ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 150.9MB in the beginning and 163.3MB in the end (delta: -12.4MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,296 INFO L158 Benchmark]: Witness Printer took 128.80ms. Allocated memory is still 274.7MB. Free memory was 163.3MB in the beginning and 155.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 08:07:13,297 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.17ms. Allocated memory is still 113.2MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.73ms. Allocated memory is still 182.5MB. Free memory was 145.8MB in the beginning and 132.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.04ms. Allocated memory is still 182.5MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.14ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 128.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 562.63ms. Allocated memory is still 182.5MB. Free memory was 128.0MB in the beginning and 151.8MB in the end (delta: -23.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7761.81ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 150.9MB in the beginning and 163.3MB in the end (delta: -12.4MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. * Witness Printer took 128.80ms. Allocated memory is still 274.7MB. Free memory was 163.3MB in the beginning and 155.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1296 mSDsluCounter, 3722 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2383 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 656 IncrementalHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 1339 mSDtfsCounter, 656 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1092 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1208 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1156 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 310/386 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]: Location Invariant Derived location invariant: null - InvariantResult [Line: 117]: Location Invariant Derived location invariant: null - InvariantResult [Line: 247]: Location Invariant Derived location invariant: null - InvariantResult [Line: 160]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 76]: Procedure Contract for immediate_notify_threads Derived contract for procedure immediate_notify_threads. Requires: ((((((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_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))) && (((1 < p_dw_st) || (p_dw_st == 0)) || (q_free != 1))) && (((((((((((((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_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_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-16 08:07:13,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE