./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:12:04,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:12:04,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:12:04,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:12:04,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:12:04,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:12:04,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:12:04,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:12:04,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:12:04,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:12:04,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:12:04,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:12:04,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:12:04,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:12:04,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:12:04,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:12:04,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:12:04,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:12:04,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:12:04,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:12:04,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:12:04,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:12:04,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:12:04,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:12:04,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:12:04,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:12:04,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:12:04,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:12:04,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:12:04,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:12:04,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:12:04,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:12:04,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:12:04,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:12:04,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:12:04,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:12:04,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:12:04,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:12:04,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:12:04,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:12:04,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:12:04,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:12:04,658 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-clean/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-clean/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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2024-10-11 03:12:04,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:12:04,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:12:04,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:12:04,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:12:04,939 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:12:04,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-10-11 03:12:06,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:12:06,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:12:06,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-10-11 03:12:06,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a43487cd5/161d78ab974d45588ebf80237b2a4914/FLAG1a469c94e [2024-10-11 03:12:06,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a43487cd5/161d78ab974d45588ebf80237b2a4914 [2024-10-11 03:12:06,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:12:06,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:12:06,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:12:06,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:12:06,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:12:06,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:06" (1/1) ... [2024-10-11 03:12:06,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8dca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:06, skipping insertion in model container [2024-10-11 03:12:06,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:06" (1/1) ... [2024-10-11 03:12:06,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:12:06,966 WARN L248 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/mem_slave_tlm.1.cil.c[646,659] [2024-10-11 03:12:07,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:12:07,103 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:12:07,114 WARN L248 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/mem_slave_tlm.1.cil.c[646,659] [2024-10-11 03:12:07,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:12:07,208 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:12:07,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07 WrapperNode [2024-10-11 03:12:07,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:12:07,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:12:07,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:12:07,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:12:07,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,272 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 847 [2024-10-11 03:12:07,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:12:07,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:12:07,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:12:07,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:12:07,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,338 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-10-11 03:12:07,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:12:07,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:12:07,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:12:07,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:12:07,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (1/1) ... [2024-10-11 03:12:07,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:12:07,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:07,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:12:07,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:12:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:12:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:12:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:12:07,507 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:12:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:12:07,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:12:07,613 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:12:07,616 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:12:08,426 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-11 03:12:08,427 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:12:08,491 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:12:08,495 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 03:12:08,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:08 BoogieIcfgContainer [2024-10-11 03:12:08,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:12:08,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:12:08,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:12:08,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:12:08,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:12:06" (1/3) ... [2024-10-11 03:12:08,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b6b650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:08, skipping insertion in model container [2024-10-11 03:12:08,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:07" (2/3) ... [2024-10-11 03:12:08,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b6b650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:08, skipping insertion in model container [2024-10-11 03:12:08,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:08" (3/3) ... [2024-10-11 03:12:08,507 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2024-10-11 03:12:08,521 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:12:08,521 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:12:08,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:12:08,601 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;@7234e082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:12:08,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:12:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 239 states have (on average 1.9372384937238494) internal successors, (463), 245 states have internal predecessors, (463), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 03:12:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:12:08,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:08,621 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] [2024-10-11 03:12:08,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1942219643, now seen corresponding path program 1 times [2024-10-11 03:12:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649037121] [2024-10-11 03:12:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:08,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649037121] [2024-10-11 03:12:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649037121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:08,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:12:08,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380176870] [2024-10-11 03:12:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:08,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:08,996 INFO L87 Difference]: Start difference. First operand has 247 states, 239 states have (on average 1.9372384937238494) internal successors, (463), 245 states have internal predecessors, (463), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:09,344 INFO L93 Difference]: Finished difference Result 650 states and 1243 transitions. [2024-10-11 03:12:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 03:12:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:09,358 INFO L225 Difference]: With dead ends: 650 [2024-10-11 03:12:09,359 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 03:12:09,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:09,366 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 239 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:09,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 686 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 03:12:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 396. [2024-10-11 03:12:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 390 states have (on average 1.6333333333333333) internal successors, (637), 394 states have internal predecessors, (637), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 642 transitions. [2024-10-11 03:12:09,449 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 642 transitions. Word has length 26 [2024-10-11 03:12:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 642 transitions. [2024-10-11 03:12:09,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 642 transitions. [2024-10-11 03:12:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:12:09,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:09,454 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] [2024-10-11 03:12:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:12:09,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:09,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash -849969164, now seen corresponding path program 1 times [2024-10-11 03:12:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:09,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603737496] [2024-10-11 03:12:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603737496] [2024-10-11 03:12:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603737496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731811020] [2024-10-11 03:12:09,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:09,541 INFO L87 Difference]: Start difference. First operand 396 states and 642 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:09,712 INFO L93 Difference]: Finished difference Result 1036 states and 1704 transitions. [2024-10-11 03:12:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 03:12:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:09,717 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 03:12:09,717 INFO L226 Difference]: Without dead ends: 653 [2024-10-11 03:12:09,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:09,723 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 304 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:09,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 916 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-10-11 03:12:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 646. [2024-10-11 03:12:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 640 states have (on average 1.6640625) internal successors, (1065), 644 states have internal predecessors, (1065), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1070 transitions. [2024-10-11 03:12:09,768 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1070 transitions. Word has length 35 [2024-10-11 03:12:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 1070 transitions. [2024-10-11 03:12:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1070 transitions. [2024-10-11 03:12:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:12:09,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:09,775 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] [2024-10-11 03:12:09,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:12:09,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash 626917057, now seen corresponding path program 1 times [2024-10-11 03:12:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293862830] [2024-10-11 03:12:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:09,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293862830] [2024-10-11 03:12:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293862830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:09,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:12:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224983276] [2024-10-11 03:12:09,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:09,852 INFO L87 Difference]: Start difference. First operand 646 states and 1070 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:09,966 INFO L93 Difference]: Finished difference Result 1628 states and 2703 transitions. [2024-10-11 03:12:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:09,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 03:12:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:09,973 INFO L225 Difference]: With dead ends: 1628 [2024-10-11 03:12:09,974 INFO L226 Difference]: Without dead ends: 1006 [2024-10-11 03:12:09,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:09,979 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 328 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:09,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 730 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2024-10-11 03:12:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 995. [2024-10-11 03:12:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 989 states have (on average 1.6612740141557127) internal successors, (1643), 993 states have internal predecessors, (1643), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1648 transitions. [2024-10-11 03:12:10,018 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1648 transitions. Word has length 36 [2024-10-11 03:12:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1648 transitions. [2024-10-11 03:12:10,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1648 transitions. [2024-10-11 03:12:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 03:12:10,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:10,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:10,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:12:10,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1434445802, now seen corresponding path program 1 times [2024-10-11 03:12:10,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:10,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232819968] [2024-10-11 03:12:10,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:10,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232819968] [2024-10-11 03:12:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232819968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:10,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:10,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133101858] [2024-10-11 03:12:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:10,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:12:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:10,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:12:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:12:10,138 INFO L87 Difference]: Start difference. First operand 995 states and 1648 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:10,686 INFO L93 Difference]: Finished difference Result 3506 states and 5820 transitions. [2024-10-11 03:12:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:12:10,686 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 03:12:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:10,723 INFO L225 Difference]: With dead ends: 3506 [2024-10-11 03:12:10,723 INFO L226 Difference]: Without dead ends: 2535 [2024-10-11 03:12:10,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:12:10,726 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 1085 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:10,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1407 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:12:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2024-10-11 03:12:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2053. [2024-10-11 03:12:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2047 states have (on average 1.65657059110894) internal successors, (3391), 2051 states have internal predecessors, (3391), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3396 transitions. [2024-10-11 03:12:10,811 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3396 transitions. Word has length 43 [2024-10-11 03:12:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:10,812 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3396 transitions. [2024-10-11 03:12:10,812 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3396 transitions. [2024-10-11 03:12:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:12:10,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:10,816 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] [2024-10-11 03:12:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:12:10,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -528401876, now seen corresponding path program 1 times [2024-10-11 03:12:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347975212] [2024-10-11 03:12:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347975212] [2024-10-11 03:12:10,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347975212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:10,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:10,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797844587] [2024-10-11 03:12:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:10,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:12:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:12:10,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:12:10,909 INFO L87 Difference]: Start difference. First operand 2053 states and 3396 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:11,397 INFO L93 Difference]: Finished difference Result 5998 states and 9795 transitions. [2024-10-11 03:12:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:12:11,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:12:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:11,413 INFO L225 Difference]: With dead ends: 5998 [2024-10-11 03:12:11,414 INFO L226 Difference]: Without dead ends: 3963 [2024-10-11 03:12:11,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:12:11,419 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 692 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:11,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 915 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:12:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2024-10-11 03:12:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3617. [2024-10-11 03:12:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3611 states have (on average 1.6194959844918304) internal successors, (5848), 3615 states have internal predecessors, (5848), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5853 transitions. [2024-10-11 03:12:11,572 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5853 transitions. Word has length 50 [2024-10-11 03:12:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:11,574 INFO L471 AbstractCegarLoop]: Abstraction has 3617 states and 5853 transitions. [2024-10-11 03:12:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5853 transitions. [2024-10-11 03:12:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:12:11,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:11,576 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] [2024-10-11 03:12:11,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:12:11,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1616382261, now seen corresponding path program 1 times [2024-10-11 03:12:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075372092] [2024-10-11 03:12:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:11,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:11,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075372092] [2024-10-11 03:12:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075372092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:11,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:11,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:12:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371522626] [2024-10-11 03:12:11,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:11,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:11,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:11,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:11,628 INFO L87 Difference]: Start difference. First operand 3617 states and 5853 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:11,787 INFO L93 Difference]: Finished difference Result 8582 states and 13842 transitions. [2024-10-11 03:12:11,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:12:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:11,811 INFO L225 Difference]: With dead ends: 8582 [2024-10-11 03:12:11,812 INFO L226 Difference]: Without dead ends: 4987 [2024-10-11 03:12:11,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:11,823 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 343 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:11,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 625 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:12:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-11 03:12:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4711. [2024-10-11 03:12:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4711 states, 4705 states have (on average 1.5982996811902233) internal successors, (7520), 4709 states have internal predecessors, (7520), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4711 states to 4711 states and 7525 transitions. [2024-10-11 03:12:11,985 INFO L78 Accepts]: Start accepts. Automaton has 4711 states and 7525 transitions. Word has length 50 [2024-10-11 03:12:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:11,985 INFO L471 AbstractCegarLoop]: Abstraction has 4711 states and 7525 transitions. [2024-10-11 03:12:11,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4711 states and 7525 transitions. [2024-10-11 03:12:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:12:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:11,988 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, 1, 1, 1] [2024-10-11 03:12:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:12:11,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:11,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 383831093, now seen corresponding path program 1 times [2024-10-11 03:12:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890493863] [2024-10-11 03:12:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890493863] [2024-10-11 03:12:12,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890493863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:12,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:12,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604600510] [2024-10-11 03:12:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:12,049 INFO L87 Difference]: Start difference. First operand 4711 states and 7525 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:12,460 INFO L93 Difference]: Finished difference Result 11379 states and 18257 transitions. [2024-10-11 03:12:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:12,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 03:12:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:12,488 INFO L225 Difference]: With dead ends: 11379 [2024-10-11 03:12:12,488 INFO L226 Difference]: Without dead ends: 6690 [2024-10-11 03:12:12,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:12,497 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 229 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:12,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 775 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6690 states. [2024-10-11 03:12:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6690 to 5447. [2024-10-11 03:12:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5447 states, 5441 states have (on average 1.5421797463701525) internal successors, (8391), 5445 states have internal predecessors, (8391), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 5447 states and 8396 transitions. [2024-10-11 03:12:12,711 INFO L78 Accepts]: Start accepts. Automaton has 5447 states and 8396 transitions. Word has length 54 [2024-10-11 03:12:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:12,712 INFO L471 AbstractCegarLoop]: Abstraction has 5447 states and 8396 transitions. [2024-10-11 03:12:12,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5447 states and 8396 transitions. [2024-10-11 03:12:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:12:12,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:12,715 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, 1, 1, 1, 1, 1] [2024-10-11 03:12:12,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:12:12,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:12,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 78251081, now seen corresponding path program 1 times [2024-10-11 03:12:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763493577] [2024-10-11 03:12:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763493577] [2024-10-11 03:12:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763493577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:12,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:12,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:12:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712162225] [2024-10-11 03:12:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:12,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:12,782 INFO L87 Difference]: Start difference. First operand 5447 states and 8396 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:12,964 INFO L93 Difference]: Finished difference Result 10738 states and 16570 transitions. [2024-10-11 03:12:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:12,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 03:12:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:12,987 INFO L225 Difference]: With dead ends: 10738 [2024-10-11 03:12:12,987 INFO L226 Difference]: Without dead ends: 5313 [2024-10-11 03:12:13,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:13,002 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 320 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:13,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 393 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2024-10-11 03:12:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5313. [2024-10-11 03:12:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5313 states, 5307 states have (on average 1.5213868475598267) internal successors, (8074), 5311 states have internal predecessors, (8074), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5313 states to 5313 states and 8079 transitions. [2024-10-11 03:12:13,194 INFO L78 Accepts]: Start accepts. Automaton has 5313 states and 8079 transitions. Word has length 56 [2024-10-11 03:12:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 5313 states and 8079 transitions. [2024-10-11 03:12:13,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5313 states and 8079 transitions. [2024-10-11 03:12:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:12:13,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:13,197 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, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:13,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:12:13,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash 268995730, now seen corresponding path program 1 times [2024-10-11 03:12:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530087202] [2024-10-11 03:12:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530087202] [2024-10-11 03:12:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530087202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229576756] [2024-10-11 03:12:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:13,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:13,244 INFO L87 Difference]: Start difference. First operand 5313 states and 8079 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:13,373 INFO L93 Difference]: Finished difference Result 10265 states and 15744 transitions. [2024-10-11 03:12:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:13,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 03:12:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:13,391 INFO L225 Difference]: With dead ends: 10265 [2024-10-11 03:12:13,391 INFO L226 Difference]: Without dead ends: 4974 [2024-10-11 03:12:13,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:13,402 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 145 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:13,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 815 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:12:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2024-10-11 03:12:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 4317. [2024-10-11 03:12:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 4311 states have (on average 1.5474367896079795) internal successors, (6671), 4315 states have internal predecessors, (6671), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6676 transitions. [2024-10-11 03:12:13,555 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6676 transitions. Word has length 57 [2024-10-11 03:12:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:13,556 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 6676 transitions. [2024-10-11 03:12:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6676 transitions. [2024-10-11 03:12:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:12:13,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:13,557 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:13,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:12:13,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1992167834, now seen corresponding path program 1 times [2024-10-11 03:12:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234211974] [2024-10-11 03:12:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:13,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234211974] [2024-10-11 03:12:13,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234211974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:12:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319037382] [2024-10-11 03:12:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:13,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:13,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:13,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:13,660 INFO L87 Difference]: Start difference. First operand 4317 states and 6676 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:14,267 INFO L93 Difference]: Finished difference Result 12578 states and 19481 transitions. [2024-10-11 03:12:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:12:14,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 03:12:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:14,293 INFO L225 Difference]: With dead ends: 12578 [2024-10-11 03:12:14,293 INFO L226 Difference]: Without dead ends: 8463 [2024-10-11 03:12:14,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:12:14,305 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 888 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:14,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 2152 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:12:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8463 states. [2024-10-11 03:12:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8463 to 5861. [2024-10-11 03:12:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5861 states, 5855 states have (on average 1.55132365499573) internal successors, (9083), 5859 states have internal predecessors, (9083), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 9088 transitions. [2024-10-11 03:12:14,574 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 9088 transitions. Word has length 59 [2024-10-11 03:12:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:14,575 INFO L471 AbstractCegarLoop]: Abstraction has 5861 states and 9088 transitions. [2024-10-11 03:12:14,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 9088 transitions. [2024-10-11 03:12:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:12:14,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:14,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:14,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:12:14,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1616535386, now seen corresponding path program 1 times [2024-10-11 03:12:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161993286] [2024-10-11 03:12:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161993286] [2024-10-11 03:12:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161993286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412283390] [2024-10-11 03:12:14,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:14,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:14,683 INFO L87 Difference]: Start difference. First operand 5861 states and 9088 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:15,081 INFO L93 Difference]: Finished difference Result 8448 states and 12944 transitions. [2024-10-11 03:12:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:12:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:12:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:15,100 INFO L225 Difference]: With dead ends: 8448 [2024-10-11 03:12:15,101 INFO L226 Difference]: Without dead ends: 8445 [2024-10-11 03:12:15,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:12:15,104 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 795 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:15,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2681 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2024-10-11 03:12:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 6201. [2024-10-11 03:12:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6201 states, 6195 states have (on average 1.5404358353510896) internal successors, (9543), 6199 states have internal predecessors, (9543), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 9548 transitions. [2024-10-11 03:12:15,282 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 9548 transitions. Word has length 60 [2024-10-11 03:12:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:15,282 INFO L471 AbstractCegarLoop]: Abstraction has 6201 states and 9548 transitions. [2024-10-11 03:12:15,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 9548 transitions. [2024-10-11 03:12:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:12:15,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:15,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:12:15,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1019410675, now seen corresponding path program 1 times [2024-10-11 03:12:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083436295] [2024-10-11 03:12:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083436295] [2024-10-11 03:12:15,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083436295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:15,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:15,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:12:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909792426] [2024-10-11 03:12:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:15,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:15,313 INFO L87 Difference]: Start difference. First operand 6201 states and 9548 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:15,569 INFO L93 Difference]: Finished difference Result 13133 states and 20166 transitions. [2024-10-11 03:12:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:12:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:15,586 INFO L225 Difference]: With dead ends: 13133 [2024-10-11 03:12:15,586 INFO L226 Difference]: Without dead ends: 6952 [2024-10-11 03:12:15,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:15,597 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 122 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:15,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 724 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2024-10-11 03:12:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 6866. [2024-10-11 03:12:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6866 states, 6860 states have (on average 1.5323615160349855) internal successors, (10512), 6864 states have internal predecessors, (10512), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6866 states to 6866 states and 10517 transitions. [2024-10-11 03:12:15,780 INFO L78 Accepts]: Start accepts. Automaton has 6866 states and 10517 transitions. Word has length 74 [2024-10-11 03:12:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:15,781 INFO L471 AbstractCegarLoop]: Abstraction has 6866 states and 10517 transitions. [2024-10-11 03:12:15,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6866 states and 10517 transitions. [2024-10-11 03:12:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:12:15,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:15,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:12:15,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2089129415, now seen corresponding path program 1 times [2024-10-11 03:12:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179396227] [2024-10-11 03:12:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:15,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179396227] [2024-10-11 03:12:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179396227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:15,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:12:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57947557] [2024-10-11 03:12:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:12:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:12:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:12:15,841 INFO L87 Difference]: Start difference. First operand 6866 states and 10517 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:16,372 INFO L93 Difference]: Finished difference Result 17795 states and 26970 transitions. [2024-10-11 03:12:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:12:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 03:12:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:16,403 INFO L225 Difference]: With dead ends: 17795 [2024-10-11 03:12:16,403 INFO L226 Difference]: Without dead ends: 10816 [2024-10-11 03:12:16,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-11 03:12:16,418 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 600 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:16,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1107 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2024-10-11 03:12:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 9583. [2024-10-11 03:12:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9583 states, 9577 states have (on average 1.496188785632244) internal successors, (14329), 9581 states have internal predecessors, (14329), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9583 states to 9583 states and 14334 transitions. [2024-10-11 03:12:16,808 INFO L78 Accepts]: Start accepts. Automaton has 9583 states and 14334 transitions. Word has length 85 [2024-10-11 03:12:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:16,809 INFO L471 AbstractCegarLoop]: Abstraction has 9583 states and 14334 transitions. [2024-10-11 03:12:16,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9583 states and 14334 transitions. [2024-10-11 03:12:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:12:16,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:16,812 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:16,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:12:16,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:16,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:16,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1030734086, now seen corresponding path program 1 times [2024-10-11 03:12:16,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:16,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131481099] [2024-10-11 03:12:16,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131481099] [2024-10-11 03:12:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131481099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:16,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474969410] [2024-10-11 03:12:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:16,869 INFO L87 Difference]: Start difference. First operand 9583 states and 14334 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:17,078 INFO L93 Difference]: Finished difference Result 13664 states and 20498 transitions. [2024-10-11 03:12:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:17,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:12:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:17,091 INFO L225 Difference]: With dead ends: 13664 [2024-10-11 03:12:17,091 INFO L226 Difference]: Without dead ends: 4091 [2024-10-11 03:12:17,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:17,104 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 315 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:17,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 457 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2024-10-11 03:12:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 4033. [2024-10-11 03:12:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 4027 states have (on average 1.3970697789918054) internal successors, (5626), 4031 states have internal predecessors, (5626), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5631 transitions. [2024-10-11 03:12:17,265 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 5631 transitions. Word has length 91 [2024-10-11 03:12:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:17,265 INFO L471 AbstractCegarLoop]: Abstraction has 4033 states and 5631 transitions. [2024-10-11 03:12:17,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5631 transitions. [2024-10-11 03:12:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:12:17,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:17,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:17,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:12:17,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2072875102, now seen corresponding path program 1 times [2024-10-11 03:12:17,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:17,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136840149] [2024-10-11 03:12:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136840149] [2024-10-11 03:12:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136840149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615174314] [2024-10-11 03:12:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:17,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:17,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:17,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:17,339 INFO L87 Difference]: Start difference. First operand 4033 states and 5631 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:17,562 INFO L93 Difference]: Finished difference Result 9481 states and 13235 transitions. [2024-10-11 03:12:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:12:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-11 03:12:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:17,574 INFO L225 Difference]: With dead ends: 9481 [2024-10-11 03:12:17,574 INFO L226 Difference]: Without dead ends: 5612 [2024-10-11 03:12:17,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:17,580 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 511 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:17,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2104 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2024-10-11 03:12:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 4035. [2024-10-11 03:12:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 4029 states have (on average 1.3938942665673864) internal successors, (5616), 4033 states have internal predecessors, (5616), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5621 transitions. [2024-10-11 03:12:17,703 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5621 transitions. Word has length 95 [2024-10-11 03:12:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:17,703 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 5621 transitions. [2024-10-11 03:12:17,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5621 transitions. [2024-10-11 03:12:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:12:17,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:17,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:12:17,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:17,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1856205923, now seen corresponding path program 1 times [2024-10-11 03:12:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282319866] [2024-10-11 03:12:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282319866] [2024-10-11 03:12:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282319866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995228935] [2024-10-11 03:12:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:17,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:17,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:17,772 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:12:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:17,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:12:17,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:12:18,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:12:18,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995228935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:18,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:12:18,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 03:12:18,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618069511] [2024-10-11 03:12:18,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:18,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:18,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:18,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:18,036 INFO L87 Difference]: Start difference. First operand 4035 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:18,245 INFO L93 Difference]: Finished difference Result 5162 states and 7178 transitions. [2024-10-11 03:12:18,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:18,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-11 03:12:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:18,256 INFO L225 Difference]: With dead ends: 5162 [2024-10-11 03:12:18,256 INFO L226 Difference]: Without dead ends: 5158 [2024-10-11 03:12:18,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:18,258 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 211 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:18,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 711 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2024-10-11 03:12:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 5020. [2024-10-11 03:12:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 5014 states have (on average 1.3974870362983647) internal successors, (7007), 5018 states have internal predecessors, (7007), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 7012 transitions. [2024-10-11 03:12:18,424 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 7012 transitions. Word has length 97 [2024-10-11 03:12:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 5020 states and 7012 transitions. [2024-10-11 03:12:18,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 7012 transitions. [2024-10-11 03:12:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:12:18,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:18,429 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:12:18,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:12:18,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 03:12:18,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash 631875968, now seen corresponding path program 1 times [2024-10-11 03:12:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:18,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108624064] [2024-10-11 03:12:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108624064] [2024-10-11 03:12:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108624064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215752096] [2024-10-11 03:12:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:18,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:18,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:18,726 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:18,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:12:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:12:18,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:12:18,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:12:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215752096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:12:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 03:12:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910988335] [2024-10-11 03:12:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:18,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:18,939 INFO L87 Difference]: Start difference. First operand 5020 states and 7012 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:19,091 INFO L93 Difference]: Finished difference Result 8908 states and 12502 transitions. [2024-10-11 03:12:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:19,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-10-11 03:12:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:19,101 INFO L225 Difference]: With dead ends: 8908 [2024-10-11 03:12:19,101 INFO L226 Difference]: Without dead ends: 3899 [2024-10-11 03:12:19,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:19,108 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 241 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:19,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 376 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:12:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2024-10-11 03:12:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3564. [2024-10-11 03:12:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3558 states have (on average 1.372681281618887) internal successors, (4884), 3562 states have internal predecessors, (4884), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4889 transitions. [2024-10-11 03:12:19,245 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4889 transitions. Word has length 147 [2024-10-11 03:12:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:19,246 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 4889 transitions. [2024-10-11 03:12:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4889 transitions. [2024-10-11 03:12:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:12:19,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:19,249 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:12:19,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:12:19,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 03:12:19,450 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 769921568, now seen corresponding path program 1 times [2024-10-11 03:12:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622752624] [2024-10-11 03:12:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:12:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622752624] [2024-10-11 03:12:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622752624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:12:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367720664] [2024-10-11 03:12:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:19,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:19,522 INFO L87 Difference]: Start difference. First operand 3564 states and 4889 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:19,688 INFO L93 Difference]: Finished difference Result 4120 states and 5588 transitions. [2024-10-11 03:12:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-11 03:12:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:19,693 INFO L225 Difference]: With dead ends: 4120 [2024-10-11 03:12:19,693 INFO L226 Difference]: Without dead ends: 615 [2024-10-11 03:12:19,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:12:19,700 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 125 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:19,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 342 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-11 03:12:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 607. [2024-10-11 03:12:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 603 states have (on average 1.0829187396351576) internal successors, (653), 605 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 656 transitions. [2024-10-11 03:12:19,722 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 656 transitions. Word has length 150 [2024-10-11 03:12:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:19,723 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 656 transitions. [2024-10-11 03:12:19,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 656 transitions. [2024-10-11 03:12:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 03:12:19,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:19,725 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:19,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:12:19,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:19,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash 80761447, now seen corresponding path program 1 times [2024-10-11 03:12:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130752599] [2024-10-11 03:12:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:12:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130752599] [2024-10-11 03:12:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130752599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56838929] [2024-10-11 03:12:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:19,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:19,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:12:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:19,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 03:12:19,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:12:20,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:12:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56838929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:20,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:12:20,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 03:12:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75223017] [2024-10-11 03:12:20,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:20,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:20,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:20,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:20,115 INFO L87 Difference]: Start difference. First operand 607 states and 656 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:20,183 INFO L93 Difference]: Finished difference Result 886 states and 957 transitions. [2024-10-11 03:12:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:12:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-10-11 03:12:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:20,186 INFO L225 Difference]: With dead ends: 886 [2024-10-11 03:12:20,187 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 03:12:20,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:20,188 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 214 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:20,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 388 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:12:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 03:12:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 03:12:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.080078125) internal successors, (553), 514 states have internal predecessors, (553), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 556 transitions. [2024-10-11 03:12:20,215 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 556 transitions. Word has length 153 [2024-10-11 03:12:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:20,216 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 556 transitions. [2024-10-11 03:12:20,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 556 transitions. [2024-10-11 03:12:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 03:12:20,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:20,218 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:12:20,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:12:20,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:20,419 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 820333015, now seen corresponding path program 1 times [2024-10-11 03:12:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443458592] [2024-10-11 03:12:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:12:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443458592] [2024-10-11 03:12:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443458592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:20,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:20,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:20,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214259786] [2024-10-11 03:12:20,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:20,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:20,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:20,542 INFO L87 Difference]: Start difference. First operand 516 states and 556 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:20,666 INFO L93 Difference]: Finished difference Result 524 states and 563 transitions. [2024-10-11 03:12:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:12:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-10-11 03:12:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:20,670 INFO L225 Difference]: With dead ends: 524 [2024-10-11 03:12:20,670 INFO L226 Difference]: Without dead ends: 521 [2024-10-11 03:12:20,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:12:20,671 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 197 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:20,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1129 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-11 03:12:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2024-10-11 03:12:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 512 states have (on average 1.076171875) internal successors, (551), 513 states have internal predecessors, (551), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 553 transitions. [2024-10-11 03:12:20,694 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 553 transitions. Word has length 155 [2024-10-11 03:12:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:20,695 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 553 transitions. [2024-10-11 03:12:20,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 553 transitions. [2024-10-11 03:12:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:12:20,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:20,697 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:12:20,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:12:20,697 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:20,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash -328354987, now seen corresponding path program 1 times [2024-10-11 03:12:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:20,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802052332] [2024-10-11 03:12:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:12:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:20,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802052332] [2024-10-11 03:12:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802052332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311473511] [2024-10-11 03:12:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:20,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:20,808 INFO L87 Difference]: Start difference. First operand 515 states and 553 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:20,895 INFO L93 Difference]: Finished difference Result 612 states and 653 transitions. [2024-10-11 03:12:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:12:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-10-11 03:12:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:20,899 INFO L225 Difference]: With dead ends: 612 [2024-10-11 03:12:20,900 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 03:12:20,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:20,901 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 147 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:20,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 711 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:12:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 03:12:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2024-10-11 03:12:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 506 states have (on average 1.065217391304348) internal successors, (539), 506 states have internal predecessors, (539), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 540 transitions. [2024-10-11 03:12:20,934 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 540 transitions. Word has length 156 [2024-10-11 03:12:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:20,935 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 540 transitions. [2024-10-11 03:12:20,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 540 transitions. [2024-10-11 03:12:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 03:12:20,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:20,938 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:12:20,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:12:20,938 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1134668779, now seen corresponding path program 1 times [2024-10-11 03:12:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201846025] [2024-10-11 03:12:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201846025] [2024-10-11 03:12:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201846025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945210100] [2024-10-11 03:12:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:21,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:21,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:12:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:21,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:12:21,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:22,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:12:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945210100] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:12:22,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:12:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 26 [2024-10-11 03:12:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441638557] [2024-10-11 03:12:22,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:12:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:12:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:12:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:12:22,715 INFO L87 Difference]: Start difference. First operand 508 states and 540 transitions. Second operand has 26 states, 26 states have (on average 12.73076923076923) internal successors, (331), 26 states have internal predecessors, (331), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:23,241 INFO L93 Difference]: Finished difference Result 514 states and 546 transitions. [2024-10-11 03:12:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:12:23,242 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.73076923076923) internal successors, (331), 26 states have internal predecessors, (331), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2024-10-11 03:12:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:23,245 INFO L225 Difference]: With dead ends: 514 [2024-10-11 03:12:23,245 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:12:23,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1449, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:12:23,247 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 570 mSDsluCounter, 4563 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 4851 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:23,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 4851 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:12:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:12:23,248 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-10-11 03:12:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:12:23,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2024-10-11 03:12:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:23,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:12:23,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.73076923076923) internal successors, (331), 26 states have internal predecessors, (331), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:12:23,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:12:23,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:12:23,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:12:23,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 03:12:23,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:23,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:12:34,955 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:12:35,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:12:35 BoogieIcfgContainer [2024-10-11 03:12:35,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:12:35,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:12:35,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:12:35,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:12:35,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:08" (3/4) ... [2024-10-11 03:12:35,024 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:12:35,029 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-10-11 03:12:35,056 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 03:12:35,057 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 03:12:35,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:12:35,060 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:12:35,252 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:12:35,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:12:35,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:12:35,257 INFO L158 Benchmark]: Toolchain (without parser) took 28504.09ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 89.9MB in the beginning and 841.2MB in the end (delta: -751.3MB). Peak memory consumption was 720.9MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,257 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:12:35,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.81ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 67.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.02ms. Allocated memory is still 159.4MB. Free memory was 67.4MB in the beginning and 63.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,258 INFO L158 Benchmark]: Boogie Preprocessor took 136.68ms. Allocated memory is still 159.4MB. Free memory was 63.7MB in the beginning and 125.5MB in the end (delta: -61.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,258 INFO L158 Benchmark]: RCFGBuilder took 1083.68ms. Allocated memory is still 159.4MB. Free memory was 125.5MB in the beginning and 66.0MB in the end (delta: 59.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,259 INFO L158 Benchmark]: TraceAbstraction took 26518.76ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 65.5MB in the beginning and 854.8MB in the end (delta: -789.3MB). Peak memory consumption was 796.1MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,259 INFO L158 Benchmark]: Witness Printer took 238.97ms. Allocated memory is still 1.6GB. Free memory was 854.8MB in the beginning and 841.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 03:12:35,260 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.16ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.81ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 67.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.02ms. Allocated memory is still 159.4MB. Free memory was 67.4MB in the beginning and 63.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.68ms. Allocated memory is still 159.4MB. Free memory was 63.7MB in the beginning and 125.5MB in the end (delta: -61.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1083.68ms. Allocated memory is still 159.4MB. Free memory was 125.5MB in the beginning and 66.0MB in the end (delta: 59.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26518.76ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 65.5MB in the beginning and 854.8MB in the end (delta: -789.3MB). Peak memory consumption was 796.1MB. Max. memory is 16.1GB. * Witness Printer took 238.97ms. Allocated memory is still 1.6GB. Free memory was 854.8MB in the beginning and 841.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. 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: 20]: 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 2 procedures, 247 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8621 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8621 mSDsluCounter, 24995 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16208 mSDsCounter, 442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3836 IncrementalHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 442 mSolverCounterUnsat, 8787 mSDtfsCounter, 3836 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9583occurred in iteration=13, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 11318 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2552 NumberOfCodeBlocks, 2552 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2738 ConstructedInterpolants, 0 QuantifiedInterpolants, 7038 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1989 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 336/516 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: 485]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) || ((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_st != 0)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_type != 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((s_run_st != 0) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (c_req_d == 50))) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) - ProcedureContractResult [Line: 16]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-11 03:12:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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