./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label33.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:30:48,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:30:48,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:30:48,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:30:48,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:30:48,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:30:48,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:30:48,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:30:48,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:30:48,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:30:48,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:30:48,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:30:48,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:30:48,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:30:48,609 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:30:48,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:30:48,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:30:48,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:30:48,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:30:48,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:30:48,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:30:48,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:30:48,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:30:48,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:30:48,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:30:48,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:30:48,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:30:48,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:30:48,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:30:48,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:30:48,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:30:48,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:30:48,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:30:48,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:30:48,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:30:48,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:30:48,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:30:48,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:30:48,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:30:48,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:30:48,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:30:48,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:30:48,627 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 [2024-11-08 10:30:48,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:30:48,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:30:48,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:30:48,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:30:48,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:30:48,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2024-11-08 10:30:50,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:30:50,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:30:50,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2024-11-08 10:30:50,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f9de8a0/b9412399c508429caf3241bd95e12eb3/FLAGe8e88cb4d [2024-11-08 10:30:50,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f9de8a0/b9412399c508429caf3241bd95e12eb3 [2024-11-08 10:30:50,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:30:50,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:30:50,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:30:50,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:30:50,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:30:50,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:30:50" (1/1) ... [2024-11-08 10:30:50,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:50, skipping insertion in model container [2024-11-08 10:30:50,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:30:50" (1/1) ... [2024-11-08 10:30:50,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:30:51,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c[55678,55691] [2024-11-08 10:30:51,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:30:51,148 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:30:51,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c[55678,55691] [2024-11-08 10:30:51,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:30:51,397 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:30:51,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51 WrapperNode [2024-11-08 10:30:51,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:30:51,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:30:51,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:30:51,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:30:51,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,501 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:30:51,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:30:51,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:30:51,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:30:51,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:30:51,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:30:51,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:30:51,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:30:51,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:30:51,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:30:51,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (1/1) ... [2024-11-08 10:30:51,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:30:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:51,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:30:51,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:30:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:30:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:30:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:30:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:30:51,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:30:51,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:30:53,189 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:30:53,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:30:53,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:30:53,209 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:30:53,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:30:53 BoogieIcfgContainer [2024-11-08 10:30:53,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:30:53,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:30:53,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:30:53,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:30:53,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:30:50" (1/3) ... [2024-11-08 10:30:53,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f2b093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:30:53, skipping insertion in model container [2024-11-08 10:30:53,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:51" (2/3) ... [2024-11-08 10:30:53,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f2b093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:30:53, skipping insertion in model container [2024-11-08 10:30:53,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:30:53" (3/3) ... [2024-11-08 10:30:53,217 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label33.c [2024-11-08 10:30:53,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:30:53,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:30:53,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:30:53,299 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;@4a60961b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:30:53,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:30:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 10:30:53,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:53,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:53,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash 263676051, now seen corresponding path program 1 times [2024-11-08 10:30:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:53,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451634995] [2024-11-08 10:30:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451634995] [2024-11-08 10:30:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451634995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671019481] [2024-11-08 10:30:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:53,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:53,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:53,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:53,934 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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) Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:54,851 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2024-11-08 10:30:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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) Word has length 159 [2024-11-08 10:30:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:54,867 INFO L225 Difference]: With dead ends: 829 [2024-11-08 10:30:54,868 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 10:30:54,871 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-11-08 10:30:54,873 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 132 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:54,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 127 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:30:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 10:30:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2024-11-08 10:30:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2024-11-08 10:30:54,922 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 159 [2024-11-08 10:30:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:54,923 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2024-11-08 10:30:54,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2024-11-08 10:30:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 10:30:54,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:54,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:54,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:30:54,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:54,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2003484099, now seen corresponding path program 1 times [2024-11-08 10:30:54,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:54,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768381828] [2024-11-08 10:30:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768381828] [2024-11-08 10:30:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768381828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459272473] [2024-11-08 10:30:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:55,153 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:55,812 INFO L93 Difference]: Finished difference Result 1319 states and 2138 transitions. [2024-11-08 10:30:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:55,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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) Word has length 164 [2024-11-08 10:30:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:55,819 INFO L225 Difference]: With dead ends: 1319 [2024-11-08 10:30:55,820 INFO L226 Difference]: Without dead ends: 872 [2024-11-08 10:30:55,823 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-11-08 10:30:55,824 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:55,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 150 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-08 10:30:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2024-11-08 10:30:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2024-11-08 10:30:55,854 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 164 [2024-11-08 10:30:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:55,854 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2024-11-08 10:30:55,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2024-11-08 10:30:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 10:30:55,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:55,858 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:55,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:30:55,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:55,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash -254954995, now seen corresponding path program 1 times [2024-11-08 10:30:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715495188] [2024-11-08 10:30:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715495188] [2024-11-08 10:30:56,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715495188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:56,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:56,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:56,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528629549] [2024-11-08 10:30:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:56,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:56,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:56,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:56,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:56,088 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:56,729 INFO L93 Difference]: Finished difference Result 2554 states and 3869 transitions. [2024-11-08 10:30:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:56,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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) Word has length 179 [2024-11-08 10:30:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:56,735 INFO L225 Difference]: With dead ends: 2554 [2024-11-08 10:30:56,735 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 10:30:56,737 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-11-08 10:30:56,738 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 232 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:56,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 417 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 10:30:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2024-11-08 10:30:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.3363042186571599) internal successors, (2249), 1683 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2249 transitions. [2024-11-08 10:30:56,776 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2249 transitions. Word has length 179 [2024-11-08 10:30:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:56,776 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2249 transitions. [2024-11-08 10:30:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2249 transitions. [2024-11-08 10:30:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 10:30:56,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:56,782 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:30:56,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:30:56,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1714782896, now seen corresponding path program 1 times [2024-11-08 10:30:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:56,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398533954] [2024-11-08 10:30:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398533954] [2024-11-08 10:30:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398533954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875165583] [2024-11-08 10:30:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:57,013 INFO L87 Difference]: Start difference. First operand 1684 states and 2249 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:57,649 INFO L93 Difference]: Finished difference Result 5003 states and 6686 transitions. [2024-11-08 10:30:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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) Word has length 182 [2024-11-08 10:30:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:57,662 INFO L225 Difference]: With dead ends: 5003 [2024-11-08 10:30:57,663 INFO L226 Difference]: Without dead ends: 3321 [2024-11-08 10:30:57,668 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-11-08 10:30:57,669 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 239 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:57,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 173 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2024-11-08 10:30:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3320. [2024-11-08 10:30:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.284423018981621) internal successors, (4263), 3319 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4263 transitions. [2024-11-08 10:30:57,721 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4263 transitions. Word has length 182 [2024-11-08 10:30:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:57,739 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4263 transitions. [2024-11-08 10:30:57,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4263 transitions. [2024-11-08 10:30:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 10:30:57,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:57,744 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:57,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:30:57,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:57,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1011754139, now seen corresponding path program 1 times [2024-11-08 10:30:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753659086] [2024-11-08 10:30:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753659086] [2024-11-08 10:30:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753659086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:58,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:58,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782705170] [2024-11-08 10:30:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:58,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:58,016 INFO L87 Difference]: Start difference. First operand 3320 states and 4263 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:58,758 INFO L93 Difference]: Finished difference Result 9900 states and 12714 transitions. [2024-11-08 10:30:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) Word has length 194 [2024-11-08 10:30:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:58,775 INFO L225 Difference]: With dead ends: 9900 [2024-11-08 10:30:58,775 INFO L226 Difference]: Without dead ends: 6582 [2024-11-08 10:30:58,781 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-11-08 10:30:58,782 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 203 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:58,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 417 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2024-11-08 10:30:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 6577. [2024-11-08 10:30:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 1.2244525547445255) internal successors, (8052), 6576 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 8052 transitions. [2024-11-08 10:30:58,884 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 8052 transitions. Word has length 194 [2024-11-08 10:30:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:58,884 INFO L471 AbstractCegarLoop]: Abstraction has 6577 states and 8052 transitions. [2024-11-08 10:30:58,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 8052 transitions. [2024-11-08 10:30:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 10:30:58,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:58,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:30:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:30:58,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -802689500, now seen corresponding path program 1 times [2024-11-08 10:30:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778066684] [2024-11-08 10:30:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:59,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:59,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778066684] [2024-11-08 10:30:59,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778066684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:59,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:59,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914465767] [2024-11-08 10:30:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:59,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:59,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:59,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:59,129 INFO L87 Difference]: Start difference. First operand 6577 states and 8052 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:59,811 INFO L93 Difference]: Finished difference Result 16215 states and 19822 transitions. [2024-11-08 10:30:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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) Word has length 200 [2024-11-08 10:30:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:59,836 INFO L225 Difference]: With dead ends: 16215 [2024-11-08 10:30:59,836 INFO L226 Difference]: Without dead ends: 9640 [2024-11-08 10:30:59,844 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-11-08 10:30:59,845 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:59,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 155 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2024-11-08 10:30:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9638. [2024-11-08 10:30:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.2036940956729272) internal successors, (11600), 9637 states have internal predecessors, (11600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11600 transitions. [2024-11-08 10:31:00,012 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11600 transitions. Word has length 200 [2024-11-08 10:31:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:00,013 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11600 transitions. [2024-11-08 10:31:00,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11600 transitions. [2024-11-08 10:31:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 10:31:00,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:00,024 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-08 10:31:00,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:31:00,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:00,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1201761841, now seen corresponding path program 1 times [2024-11-08 10:31:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614152784] [2024-11-08 10:31:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:00,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:00,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614152784] [2024-11-08 10:31:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614152784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263606388] [2024-11-08 10:31:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:00,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:00,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:00,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:00,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:31:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:00,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:00,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:00,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263606388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:00,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:00,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519798882] [2024-11-08 10:31:00,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:00,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:00,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:00,698 INFO L87 Difference]: Start difference. First operand 9638 states and 11600 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:01,466 INFO L93 Difference]: Finished difference Result 23771 states and 28942 transitions. [2024-11-08 10:31:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) Word has length 207 [2024-11-08 10:31:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:01,511 INFO L225 Difference]: With dead ends: 23771 [2024-11-08 10:31:01,512 INFO L226 Difference]: Without dead ends: 14135 [2024-11-08 10:31:01,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:01,529 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 86 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:01,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 166 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:31:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2024-11-08 10:31:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 12486. [2024-11-08 10:31:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12486 states, 12485 states have (on average 1.2382058470164197) internal successors, (15459), 12485 states have internal predecessors, (15459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12486 states to 12486 states and 15459 transitions. [2024-11-08 10:31:01,764 INFO L78 Accepts]: Start accepts. Automaton has 12486 states and 15459 transitions. Word has length 207 [2024-11-08 10:31:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:01,765 INFO L471 AbstractCegarLoop]: Abstraction has 12486 states and 15459 transitions. [2024-11-08 10:31:01,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12486 states and 15459 transitions. [2024-11-08 10:31:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 10:31:01,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:01,780 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:01,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:01,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:01,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -964122806, now seen corresponding path program 1 times [2024-11-08 10:31:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671310532] [2024-11-08 10:31:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:31:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671310532] [2024-11-08 10:31:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671310532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619178898] [2024-11-08 10:31:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:02,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:02,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:02,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:31:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:02,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:02,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:02,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619178898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:02,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293116283] [2024-11-08 10:31:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:02,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:02,522 INFO L87 Difference]: Start difference. First operand 12486 states and 15459 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:03,289 INFO L93 Difference]: Finished difference Result 31063 states and 39151 transitions. [2024-11-08 10:31:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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) Word has length 226 [2024-11-08 10:31:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:03,317 INFO L225 Difference]: With dead ends: 31063 [2024-11-08 10:31:03,317 INFO L226 Difference]: Without dead ends: 18579 [2024-11-08 10:31:03,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:03,331 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 228 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:03,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 166 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:31:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18579 states. [2024-11-08 10:31:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18579 to 18576. [2024-11-08 10:31:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18576 states, 18575 states have (on average 1.199407806191117) internal successors, (22279), 18575 states have internal predecessors, (22279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18576 states to 18576 states and 22279 transitions. [2024-11-08 10:31:03,547 INFO L78 Accepts]: Start accepts. Automaton has 18576 states and 22279 transitions. Word has length 226 [2024-11-08 10:31:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 18576 states and 22279 transitions. [2024-11-08 10:31:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18576 states and 22279 transitions. [2024-11-08 10:31:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 10:31:03,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:03,567 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-08 10:31:03,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:31:03,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 10:31:03,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:03,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:03,769 INFO L85 PathProgramCache]: Analyzing trace with hash -392881298, now seen corresponding path program 1 times [2024-11-08 10:31:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:03,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730655720] [2024-11-08 10:31:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 96 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 10:31:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730655720] [2024-11-08 10:31:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730655720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333321150] [2024-11-08 10:31:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:04,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:04,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:04,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:04,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:31:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:04,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:04,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 10:31:04,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333321150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668648546] [2024-11-08 10:31:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:04,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:04,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:04,457 INFO L87 Difference]: Start difference. First operand 18576 states and 22279 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:05,066 INFO L93 Difference]: Finished difference Result 37153 states and 44561 transitions. [2024-11-08 10:31:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) Word has length 246 [2024-11-08 10:31:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:05,092 INFO L225 Difference]: With dead ends: 37153 [2024-11-08 10:31:05,092 INFO L226 Difference]: Without dead ends: 18579 [2024-11-08 10:31:05,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:05,113 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 260 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:05,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 97 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18579 states. [2024-11-08 10:31:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18579 to 18576. [2024-11-08 10:31:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18576 states, 18575 states have (on average 1.1898250336473755) internal successors, (22101), 18575 states have internal predecessors, (22101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18576 states to 18576 states and 22101 transitions. [2024-11-08 10:31:05,324 INFO L78 Accepts]: Start accepts. Automaton has 18576 states and 22101 transitions. Word has length 246 [2024-11-08 10:31:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:05,324 INFO L471 AbstractCegarLoop]: Abstraction has 18576 states and 22101 transitions. [2024-11-08 10:31:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 18576 states and 22101 transitions. [2024-11-08 10:31:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 10:31:05,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:05,347 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:05,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:31:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:05,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:05,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 553705489, now seen corresponding path program 1 times [2024-11-08 10:31:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280737345] [2024-11-08 10:31:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280737345] [2024-11-08 10:31:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280737345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022102994] [2024-11-08 10:31:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:05,797 INFO L87 Difference]: Start difference. First operand 18576 states and 22101 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:06,434 INFO L93 Difference]: Finished difference Result 37153 states and 44205 transitions. [2024-11-08 10:31:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:06,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) Word has length 246 [2024-11-08 10:31:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:06,456 INFO L225 Difference]: With dead ends: 37153 [2024-11-08 10:31:06,456 INFO L226 Difference]: Without dead ends: 18579 [2024-11-08 10:31:06,470 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-11-08 10:31:06,471 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 262 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:06,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 342 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18579 states. [2024-11-08 10:31:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18579 to 18170. [2024-11-08 10:31:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18170 states, 18169 states have (on average 1.1764544003522484) internal successors, (21375), 18169 states have internal predecessors, (21375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18170 states to 18170 states and 21375 transitions. [2024-11-08 10:31:06,642 INFO L78 Accepts]: Start accepts. Automaton has 18170 states and 21375 transitions. Word has length 246 [2024-11-08 10:31:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:06,643 INFO L471 AbstractCegarLoop]: Abstraction has 18170 states and 21375 transitions. [2024-11-08 10:31:06,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18170 states and 21375 transitions. [2024-11-08 10:31:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 10:31:06,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:06,661 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:06,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:31:06,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1579003028, now seen corresponding path program 1 times [2024-11-08 10:31:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223734254] [2024-11-08 10:31:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-08 10:31:06,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223734254] [2024-11-08 10:31:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223734254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023782665] [2024-11-08 10:31:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:06,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:06,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:06,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:31:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:07,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:07,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-08 10:31:07,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023782665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710127501] [2024-11-08 10:31:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:07,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:07,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:07,170 INFO L87 Difference]: Start difference. First operand 18170 states and 21375 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:07,858 INFO L93 Difference]: Finished difference Result 35348 states and 41559 transitions. [2024-11-08 10:31:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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) Word has length 253 [2024-11-08 10:31:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:07,878 INFO L225 Difference]: With dead ends: 35348 [2024-11-08 10:31:07,878 INFO L226 Difference]: Without dead ends: 17180 [2024-11-08 10:31:07,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:07,884 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:07,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 395 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17180 states. [2024-11-08 10:31:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17180 to 17155. [2024-11-08 10:31:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17155 states, 17154 states have (on average 1.1660254168124053) internal successors, (20002), 17154 states have internal predecessors, (20002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17155 states to 17155 states and 20002 transitions. [2024-11-08 10:31:08,041 INFO L78 Accepts]: Start accepts. Automaton has 17155 states and 20002 transitions. Word has length 253 [2024-11-08 10:31:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:08,042 INFO L471 AbstractCegarLoop]: Abstraction has 17155 states and 20002 transitions. [2024-11-08 10:31:08,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17155 states and 20002 transitions. [2024-11-08 10:31:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-08 10:31:08,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:08,057 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:08,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:31:08,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:08,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash -401465329, now seen corresponding path program 1 times [2024-11-08 10:31:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989070523] [2024-11-08 10:31:08,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989070523] [2024-11-08 10:31:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989070523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:08,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752771180] [2024-11-08 10:31:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:08,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:08,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:08,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:08,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:08,405 INFO L87 Difference]: Start difference. First operand 17155 states and 20002 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:08,980 INFO L93 Difference]: Finished difference Result 33684 states and 39181 transitions. [2024-11-08 10:31:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:08,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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) Word has length 258 [2024-11-08 10:31:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:08,997 INFO L225 Difference]: With dead ends: 33684 [2024-11-08 10:31:08,998 INFO L226 Difference]: Without dead ends: 16531 [2024-11-08 10:31:09,009 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-11-08 10:31:09,010 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 266 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:09,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 371 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16531 states. [2024-11-08 10:31:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16531 to 16530. [2024-11-08 10:31:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16530 states, 16529 states have (on average 1.129529917115373) internal successors, (18670), 16529 states have internal predecessors, (18670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16530 states to 16530 states and 18670 transitions. [2024-11-08 10:31:09,264 INFO L78 Accepts]: Start accepts. Automaton has 16530 states and 18670 transitions. Word has length 258 [2024-11-08 10:31:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:09,264 INFO L471 AbstractCegarLoop]: Abstraction has 16530 states and 18670 transitions. [2024-11-08 10:31:09,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 16530 states and 18670 transitions. [2024-11-08 10:31:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-08 10:31:09,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:09,281 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:09,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:31:09,282 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1558132441, now seen corresponding path program 1 times [2024-11-08 10:31:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:09,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480229431] [2024-11-08 10:31:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:09,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480229431] [2024-11-08 10:31:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480229431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510418662] [2024-11-08 10:31:09,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:09,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:09,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:09,483 INFO L87 Difference]: Start difference. First operand 16530 states and 18670 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:10,098 INFO L93 Difference]: Finished difference Result 32853 states and 37097 transitions. [2024-11-08 10:31:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) Word has length 262 [2024-11-08 10:31:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:10,116 INFO L225 Difference]: With dead ends: 32853 [2024-11-08 10:31:10,116 INFO L226 Difference]: Without dead ends: 16325 [2024-11-08 10:31:10,128 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-11-08 10:31:10,129 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 254 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:10,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 368 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16325 states. [2024-11-08 10:31:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16325 to 13886. [2024-11-08 10:31:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13886 states, 13885 states have (on average 1.1137198415556355) internal successors, (15464), 13885 states have internal predecessors, (15464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13886 states to 13886 states and 15464 transitions. [2024-11-08 10:31:10,262 INFO L78 Accepts]: Start accepts. Automaton has 13886 states and 15464 transitions. Word has length 262 [2024-11-08 10:31:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:10,262 INFO L471 AbstractCegarLoop]: Abstraction has 13886 states and 15464 transitions. [2024-11-08 10:31:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 13886 states and 15464 transitions. [2024-11-08 10:31:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 10:31:10,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:10,271 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:10,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:31:10,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1489153831, now seen corresponding path program 1 times [2024-11-08 10:31:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:10,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888409530] [2024-11-08 10:31:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 10:31:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888409530] [2024-11-08 10:31:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888409530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759623522] [2024-11-08 10:31:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:10,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:10,467 INFO L87 Difference]: Start difference. First operand 13886 states and 15464 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:10,708 INFO L93 Difference]: Finished difference Result 40620 states and 45234 transitions. [2024-11-08 10:31:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) Word has length 268 [2024-11-08 10:31:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:10,736 INFO L225 Difference]: With dead ends: 40620 [2024-11-08 10:31:10,736 INFO L226 Difference]: Without dead ends: 26736 [2024-11-08 10:31:10,750 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-11-08 10:31:10,750 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 330 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:10,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 977 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:31:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26736 states. [2024-11-08 10:31:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26736 to 26733. [2024-11-08 10:31:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26733 states, 26732 states have (on average 1.1029103695944935) internal successors, (29483), 26732 states have internal predecessors, (29483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26733 states to 26733 states and 29483 transitions. [2024-11-08 10:31:10,989 INFO L78 Accepts]: Start accepts. Automaton has 26733 states and 29483 transitions. Word has length 268 [2024-11-08 10:31:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 26733 states and 29483 transitions. [2024-11-08 10:31:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 26733 states and 29483 transitions. [2024-11-08 10:31:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-08 10:31:11,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:11,006 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-08 10:31:11,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:31:11,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1287538419, now seen corresponding path program 1 times [2024-11-08 10:31:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406660306] [2024-11-08 10:31:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 10:31:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406660306] [2024-11-08 10:31:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406660306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183934117] [2024-11-08 10:31:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:11,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:31:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:31:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:11,233 INFO L87 Difference]: Start difference. First operand 26733 states and 29483 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:12,174 INFO L93 Difference]: Finished difference Result 60414 states and 66641 transitions. [2024-11-08 10:31:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:31:12,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 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) Word has length 284 [2024-11-08 10:31:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:12,209 INFO L225 Difference]: With dead ends: 60414 [2024-11-08 10:31:12,209 INFO L226 Difference]: Without dead ends: 33683 [2024-11-08 10:31:12,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:12,227 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 358 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:12,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 174 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:31:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33683 states. [2024-11-08 10:31:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33683 to 30818. [2024-11-08 10:31:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30818 states, 30817 states have (on average 1.101891812960379) internal successors, (33957), 30817 states have internal predecessors, (33957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30818 states to 30818 states and 33957 transitions. [2024-11-08 10:31:12,504 INFO L78 Accepts]: Start accepts. Automaton has 30818 states and 33957 transitions. Word has length 284 [2024-11-08 10:31:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:12,504 INFO L471 AbstractCegarLoop]: Abstraction has 30818 states and 33957 transitions. [2024-11-08 10:31:12,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30818 states and 33957 transitions. [2024-11-08 10:31:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-08 10:31:12,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:12,523 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:31:12,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:31:12,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash -801775645, now seen corresponding path program 1 times [2024-11-08 10:31:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136603571] [2024-11-08 10:31:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-08 10:31:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136603571] [2024-11-08 10:31:12,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136603571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812377320] [2024-11-08 10:31:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:12,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:12,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:12,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:31:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:13,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:13,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-08 10:31:13,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812377320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:13,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185951980] [2024-11-08 10:31:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:13,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:13,201 INFO L87 Difference]: Start difference. First operand 30818 states and 33957 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:13,861 INFO L93 Difference]: Finished difference Result 74883 states and 82722 transitions. [2024-11-08 10:31:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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) Word has length 287 [2024-11-08 10:31:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:13,911 INFO L225 Difference]: With dead ends: 74883 [2024-11-08 10:31:13,911 INFO L226 Difference]: Without dead ends: 44067 [2024-11-08 10:31:13,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:13,935 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 110 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:13,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 178 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44067 states. [2024-11-08 10:31:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44067 to 42019. [2024-11-08 10:31:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42019 states, 42018 states have (on average 1.0958160788233615) internal successors, (46044), 42018 states have internal predecessors, (46044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 46044 transitions. [2024-11-08 10:31:14,485 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 46044 transitions. Word has length 287 [2024-11-08 10:31:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 42019 states and 46044 transitions. [2024-11-08 10:31:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 46044 transitions. [2024-11-08 10:31:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-08 10:31:14,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:14,523 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:14,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:14,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:31:14,724 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:14,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash -879949778, now seen corresponding path program 1 times [2024-11-08 10:31:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423180838] [2024-11-08 10:31:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-08 10:31:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423180838] [2024-11-08 10:31:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423180838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527530014] [2024-11-08 10:31:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:15,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:15,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:15,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:31:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:15,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:15,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 10:31:15,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527530014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126577784] [2024-11-08 10:31:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:15,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:15,424 INFO L87 Difference]: Start difference. First operand 42019 states and 46044 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:15,878 INFO L93 Difference]: Finished difference Result 121101 states and 132604 transitions. [2024-11-08 10:31:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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) Word has length 327 [2024-11-08 10:31:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:15,970 INFO L225 Difference]: With dead ends: 121101 [2024-11-08 10:31:15,970 INFO L226 Difference]: Without dead ends: 79084 [2024-11-08 10:31:16,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:16,007 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 303 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:16,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 883 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:31:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79084 states. [2024-11-08 10:31:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79084 to 77255. [2024-11-08 10:31:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77255 states, 77254 states have (on average 1.0856395785331503) internal successors, (83870), 77254 states have internal predecessors, (83870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77255 states to 77255 states and 83870 transitions. [2024-11-08 10:31:17,055 INFO L78 Accepts]: Start accepts. Automaton has 77255 states and 83870 transitions. Word has length 327 [2024-11-08 10:31:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:17,056 INFO L471 AbstractCegarLoop]: Abstraction has 77255 states and 83870 transitions. [2024-11-08 10:31:17,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 77255 states and 83870 transitions. [2024-11-08 10:31:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-08 10:31:17,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:17,110 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:17,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:31:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 10:31:17,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:17,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1901246295, now seen corresponding path program 1 times [2024-11-08 10:31:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123128859] [2024-11-08 10:31:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:17,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 217 proven. 6 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-08 10:31:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123128859] [2024-11-08 10:31:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123128859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882853540] [2024-11-08 10:31:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:17,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:17,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:17,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:31:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:18,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:31:18,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-08 10:31:18,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882853540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:18,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 10:31:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413289253] [2024-11-08 10:31:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:18,254 INFO L87 Difference]: Start difference. First operand 77255 states and 83870 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:18,956 INFO L93 Difference]: Finished difference Result 146630 states and 159228 transitions. [2024-11-08 10:31:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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) Word has length 369 [2024-11-08 10:31:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:19,046 INFO L225 Difference]: With dead ends: 146630 [2024-11-08 10:31:19,046 INFO L226 Difference]: Without dead ends: 69377 [2024-11-08 10:31:19,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:19,214 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:19,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:31:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69377 states. [2024-11-08 10:31:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69377 to 69377. [2024-11-08 10:31:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69377 states, 69376 states have (on average 1.0796673201107012) internal successors, (74903), 69376 states have internal predecessors, (74903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69377 states to 69377 states and 74903 transitions. [2024-11-08 10:31:20,106 INFO L78 Accepts]: Start accepts. Automaton has 69377 states and 74903 transitions. Word has length 369 [2024-11-08 10:31:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:20,107 INFO L471 AbstractCegarLoop]: Abstraction has 69377 states and 74903 transitions. [2024-11-08 10:31:20,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 69377 states and 74903 transitions. [2024-11-08 10:31:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-08 10:31:20,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:20,188 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-08 10:31:20,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:31:20,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:20,389 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:20,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash -195846746, now seen corresponding path program 1 times [2024-11-08 10:31:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:20,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588383561] [2024-11-08 10:31:20,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 273 proven. 6 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2024-11-08 10:31:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588383561] [2024-11-08 10:31:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588383561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067956951] [2024-11-08 10:31:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:21,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:21,094 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:21,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:31:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:21,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:21,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2024-11-08 10:31:21,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067956951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 10:31:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033364185] [2024-11-08 10:31:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:21,523 INFO L87 Difference]: Start difference. First operand 69377 states and 74903 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:22,266 INFO L93 Difference]: Finished difference Result 207919 states and 224484 transitions. [2024-11-08 10:31:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:22,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 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) Word has length 473 [2024-11-08 10:31:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:22,429 INFO L225 Difference]: With dead ends: 207919 [2024-11-08 10:31:22,429 INFO L226 Difference]: Without dead ends: 138544 [2024-11-08 10:31:22,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:22,456 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 208 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:22,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 525 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:31:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138544 states. [2024-11-08 10:31:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138544 to 137321. [2024-11-08 10:31:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137321 states, 137320 states have (on average 1.0799883483833381) internal successors, (148304), 137320 states have internal predecessors, (148304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137321 states to 137321 states and 148304 transitions. [2024-11-08 10:31:24,277 INFO L78 Accepts]: Start accepts. Automaton has 137321 states and 148304 transitions. Word has length 473 [2024-11-08 10:31:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:24,277 INFO L471 AbstractCegarLoop]: Abstraction has 137321 states and 148304 transitions. [2024-11-08 10:31:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 137321 states and 148304 transitions. [2024-11-08 10:31:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-11-08 10:31:24,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:24,599 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:24,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 10:31:24,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:24,800 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1153641486, now seen corresponding path program 1 times [2024-11-08 10:31:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626074988] [2024-11-08 10:31:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 284 proven. 6 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-08 10:31:25,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:25,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626074988] [2024-11-08 10:31:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626074988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359265282] [2024-11-08 10:31:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:25,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:25,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:25,641 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:25,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 10:31:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:25,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:31:25,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-08 10:31:26,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359265282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:26,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628382676] [2024-11-08 10:31:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:26,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:26,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:26,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:26,028 INFO L87 Difference]: Start difference. First operand 137321 states and 148304 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:27,255 INFO L93 Difference]: Finished difference Result 232348 states and 250297 transitions. [2024-11-08 10:31:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) Word has length 478 [2024-11-08 10:31:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:27,258 INFO L225 Difference]: With dead ends: 232348 [2024-11-08 10:31:27,258 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:31:27,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:27,301 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 115 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:27,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 337 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:31:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:31:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:31:27,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 478 [2024-11-08 10:31:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:27,303 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:31:27,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:31:27,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:31:27,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:31:27,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:27,511 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] [2024-11-08 10:31:27,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:31:37,269 WARN L286 SmtUtils]: Spent 9.75s on a formula simplification. DAG size of input: 598 DAG size of output: 550 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 10:31:42,399 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 550 DAG size of output: 94 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-08 10:31:42,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:31:42,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:31:42 BoogieIcfgContainer [2024-11-08 10:31:42,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:31:42,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:31:42,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:31:42,436 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:31:42,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:30:53" (3/4) ... [2024-11-08 10:31:42,442 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:31:42,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:31:42,465 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:31:42,466 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:31:42,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:31:42,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:31:42,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:31:42,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:31:42,625 INFO L158 Benchmark]: Toolchain (without parser) took 52009.66ms. Allocated memory was 161.5MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 124.3MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-11-08 10:31:42,625 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:31:42,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.19ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 115.0MB in the end (delta: 8.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-08 10:31:42,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.30ms. Allocated memory is still 161.5MB. Free memory was 115.0MB in the beginning and 99.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:31:42,626 INFO L158 Benchmark]: Boogie Preprocessor took 141.12ms. Allocated memory is still 161.5MB. Free memory was 99.4MB in the beginning and 86.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:31:42,626 INFO L158 Benchmark]: RCFGBuilder took 1566.29ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 86.8MB in the beginning and 104.0MB in the end (delta: -17.3MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-08 10:31:42,626 INFO L158 Benchmark]: TraceAbstraction took 49224.13ms. Allocated memory was 237.0MB in the beginning and 10.1GB in the end (delta: 9.8GB). Free memory was 104.0MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2024-11-08 10:31:42,626 INFO L158 Benchmark]: Witness Printer took 188.61ms. Allocated memory is still 10.1GB. Free memory was 6.9GB in the beginning and 6.9GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 10:31:42,627 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.10ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.19ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 115.0MB in the end (delta: 8.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.30ms. Allocated memory is still 161.5MB. Free memory was 115.0MB in the beginning and 99.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.12ms. Allocated memory is still 161.5MB. Free memory was 99.4MB in the beginning and 86.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1566.29ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 86.8MB in the beginning and 104.0MB in the end (delta: -17.3MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49224.13ms. Allocated memory was 237.0MB in the beginning and 10.1GB in the end (delta: 9.8GB). Free memory was 104.0MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 188.61ms. Allocated memory is still 10.1GB. Free memory was 6.9GB in the beginning and 6.9GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 1522]: 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 1 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4535 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4535 mSDsluCounter, 6449 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1235 mSDsCounter, 2023 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10998 IncrementalHoareTripleChecker+Invalid, 13021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2023 mSolverCounterUnsat, 5214 mSDtfsCounter, 10998 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2913 GetRequests, 2874 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137321occurred in iteration=19, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 12523 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 8128 NumberOfCodeBlocks, 8128 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 8099 ConstructedInterpolants, 0 QuantifiedInterpolants, 14099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5806 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 7790/7844 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: 1668]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((a5 == 1) && ((((((2 == a3) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 <= 0)) || (((((2 == a3) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || (((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a29 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1))) || ((a5 == 1) && ((((((a6 == 1) && (a11 <= 0)) && (a12 <= 0)) && (a3 == 0)) && (a27 <= 0)) || (((((a6 == 1) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0))))) || (((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 <= 0))) || ((((((a5 == 1) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((a5 == 1) && (a12 == 1)) && (((((a26 == 1) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0)) || ((((a26 == 1) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0)))) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1))) || ((a5 == 1) && ((((((a11 == 1) && (a6 == 1)) && (a12 <= 0)) && (a3 == 0)) && (a27 <= 0)) || (((((a11 == 1) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0))))) || (((((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a29 <= 0)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 <= 0))) || ((((((a5 == 1) && (a3 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((a5 == 1) && (a12 == 1)) && (a29 <= 0)) && ((((((a25 == 1) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a6 <= 0)) || (((((a25 == 1) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))))) || (((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a7 <= 0) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a12 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((a5 == 1) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a29 <= 0)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((((2 == a3) && (a5 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a12 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1))) || ((((((a5 == 1) && (a3 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 == 1)) && (a3 == 0)) && (a27 <= 0))) || ((((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a12 <= 0)) && (a27 <= 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:31:42,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE