./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/Problem14_label04.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 fbc8b86e86cd6737c503bef017b2b1abd25895fb1927b426e7290e477fc0b63c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:36:31,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:36:31,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:36:31,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:36:31,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:36:31,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:36:31,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:36:31,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:36:31,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:36:31,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:36:31,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:36:31,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:36:31,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:36:31,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:36:31,723 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:36:31,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:36:31,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:36:31,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:36:31,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:36:31,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:36:31,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:36:31,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:36:31,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:36:31,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:36:31,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:36:31,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:36:31,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:36:31,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:36:31,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:36:31,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:36:31,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:36:31,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:36:31,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:36:31,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:36:31,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:36:31,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:36:31,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:36:31,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:36:31,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:36:31,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:36:31,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:36:31,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:36:31,736 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 -> fbc8b86e86cd6737c503bef017b2b1abd25895fb1927b426e7290e477fc0b63c [2024-11-09 19:36:31,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:36:32,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:36:32,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:36:32,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:36:32,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:36:32,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2024-11-09 19:36:33,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:36:33,750 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:36:33,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2024-11-09 19:36:33,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88dede3a5/5d9e69dba8e240d5a357229508e82720/FLAGe6847a7b6 [2024-11-09 19:36:33,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88dede3a5/5d9e69dba8e240d5a357229508e82720 [2024-11-09 19:36:33,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:36:33,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:36:33,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:36:33,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:36:33,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:36:33,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:33" (1/1) ... [2024-11-09 19:36:33,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d3cc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:33, skipping insertion in model container [2024-11-09 19:36:33,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:33" (1/1) ... [2024-11-09 19:36:33,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:36:34,091 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/Problem14_label04.c[5382,5395] [2024-11-09 19:36:34,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:36:34,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:36:34,342 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/Problem14_label04.c[5382,5395] [2024-11-09 19:36:34,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:36:34,466 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:36:34,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34 WrapperNode [2024-11-09 19:36:34,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:36:34,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:36:34,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:36:34,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:36:34,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,558 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2024-11-09 19:36:34,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:36:34,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:36:34,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:36:34,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:36:34,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,624 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-09 19:36:34,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:36:34,674 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:36:34,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:36:34,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:36:34,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (1/1) ... [2024-11-09 19:36:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:36:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:34,712 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-09 19:36:34,718 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-09 19:36:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:36:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:36:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:36:34,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:36:34,831 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:36:34,833 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:36:36,251 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-09 19:36:36,251 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:36:36,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:36:36,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:36:36,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:36 BoogieIcfgContainer [2024-11-09 19:36:36,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:36:36,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:36:36,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:36:36,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:36:36,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:33" (1/3) ... [2024-11-09 19:36:36,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2744020b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:36, skipping insertion in model container [2024-11-09 19:36:36,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:34" (2/3) ... [2024-11-09 19:36:36,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2744020b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:36, skipping insertion in model container [2024-11-09 19:36:36,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:36" (3/3) ... [2024-11-09 19:36:36,290 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label04.c [2024-11-09 19:36:36,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:36:36,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:36:36,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:36:36,394 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;@473958a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:36:36,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:36:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 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-09 19:36:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 19:36:36,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:36,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:36,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:36,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1586465933, now seen corresponding path program 1 times [2024-11-09 19:36:36,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:36,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607039185] [2024-11-09 19:36:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:36,838 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-09 19:36:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607039185] [2024-11-09 19:36:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607039185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:36,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:36,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:36:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462531645] [2024-11-09 19:36:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:36,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:36,880 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 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 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-09 19:36:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:37,997 INFO L93 Difference]: Finished difference Result 675 states and 1545 transitions. [2024-11-09 19:36:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2024-11-09 19:36:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:38,013 INFO L225 Difference]: With dead ends: 675 [2024-11-09 19:36:38,013 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 19:36:38,017 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-09 19:36:38,020 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 267 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:38,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 81 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:36:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 19:36:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-09 19:36:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.2569060773480665) internal successors, (817), 362 states have internal predecessors, (817), 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-09 19:36:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 817 transitions. [2024-11-09 19:36:38,115 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 817 transitions. Word has length 54 [2024-11-09 19:36:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:38,116 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 817 transitions. [2024-11-09 19:36:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-09 19:36:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 817 transitions. [2024-11-09 19:36:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 19:36:38,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:38,122 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, 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] [2024-11-09 19:36:38,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:36:38,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:38,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 989565679, now seen corresponding path program 1 times [2024-11-09 19:36:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866597420] [2024-11-09 19:36:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866597420] [2024-11-09 19:36:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866597420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:38,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:38,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:36:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213555772] [2024-11-09 19:36:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:38,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:38,327 INFO L87 Difference]: Start difference. First operand 363 states and 817 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-09 19:36:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:39,238 INFO L93 Difference]: Finished difference Result 1082 states and 2445 transitions. [2024-11-09 19:36:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2024-11-09 19:36:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:39,243 INFO L225 Difference]: With dead ends: 1082 [2024-11-09 19:36:39,243 INFO L226 Difference]: Without dead ends: 721 [2024-11-09 19:36:39,244 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-09 19:36:39,245 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 245 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:39,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 93 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:36:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-09 19:36:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 542. [2024-11-09 19:36:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.1164510166358594) internal successors, (1145), 541 states have internal predecessors, (1145), 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-09 19:36:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1145 transitions. [2024-11-09 19:36:39,280 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1145 transitions. Word has length 120 [2024-11-09 19:36:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:39,280 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 1145 transitions. [2024-11-09 19:36:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-09 19:36:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1145 transitions. [2024-11-09 19:36:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 19:36:39,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:39,285 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:39,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:36:39,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:39,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2145287291, now seen corresponding path program 1 times [2024-11-09 19:36:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:39,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223750301] [2024-11-09 19:36:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:39,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:39,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223750301] [2024-11-09 19:36:39,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223750301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:39,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:39,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:39,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318133] [2024-11-09 19:36:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:39,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:39,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:39,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:39,710 INFO L87 Difference]: Start difference. First operand 542 states and 1145 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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-09 19:36:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:40,948 INFO L93 Difference]: Finished difference Result 1440 states and 2944 transitions. [2024-11-09 19:36:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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 134 [2024-11-09 19:36:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:40,953 INFO L225 Difference]: With dead ends: 1440 [2024-11-09 19:36:40,953 INFO L226 Difference]: Without dead ends: 900 [2024-11-09 19:36:40,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:36:40,955 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 760 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:40,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 128 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:36:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-09 19:36:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2024-11-09 19:36:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.9632925472747498) internal successors, (1765), 899 states have internal predecessors, (1765), 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-09 19:36:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1765 transitions. [2024-11-09 19:36:40,979 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1765 transitions. Word has length 134 [2024-11-09 19:36:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:40,981 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1765 transitions. [2024-11-09 19:36:40,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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-09 19:36:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1765 transitions. [2024-11-09 19:36:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 19:36:40,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:40,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:40,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:36:40,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -604635617, now seen corresponding path program 1 times [2024-11-09 19:36:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987696317] [2024-11-09 19:36:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 19:36:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:41,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987696317] [2024-11-09 19:36:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987696317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:41,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462595248] [2024-11-09 19:36:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:41,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:41,305 INFO L87 Difference]: Start difference. First operand 900 states and 1765 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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-09 19:36:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:42,322 INFO L93 Difference]: Finished difference Result 2007 states and 3886 transitions. [2024-11-09 19:36:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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 215 [2024-11-09 19:36:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:42,329 INFO L225 Difference]: With dead ends: 2007 [2024-11-09 19:36:42,329 INFO L226 Difference]: Without dead ends: 1079 [2024-11-09 19:36:42,331 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-09 19:36:42,334 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 229 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:42,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 125 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:36:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-09 19:36:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2024-11-09 19:36:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.8079777365491652) internal successors, (1949), 1078 states have internal predecessors, (1949), 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-09 19:36:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1949 transitions. [2024-11-09 19:36:42,360 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1949 transitions. Word has length 215 [2024-11-09 19:36:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1949 transitions. [2024-11-09 19:36:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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-09 19:36:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1949 transitions. [2024-11-09 19:36:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 19:36:42,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:42,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:36:42,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:36:42,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:42,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -89299405, now seen corresponding path program 1 times [2024-11-09 19:36:42,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:42,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884739351] [2024-11-09 19:36:42,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:42,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:42,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884739351] [2024-11-09 19:36:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884739351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156780836] [2024-11-09 19:36:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:42,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:42,736 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-09 19:36:42,738 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-09 19:36:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:42,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:42,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 19:36:43,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:43,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156780836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:43,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304207191] [2024-11-09 19:36:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:43,023 INFO L87 Difference]: Start difference. First operand 1079 states and 1949 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-09 19:36:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:43,856 INFO L93 Difference]: Finished difference Result 2514 states and 4631 transitions. [2024-11-09 19:36:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 227 [2024-11-09 19:36:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:43,863 INFO L225 Difference]: With dead ends: 2514 [2024-11-09 19:36:43,863 INFO L226 Difference]: Without dead ends: 1437 [2024-11-09 19:36:43,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:43,866 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 244 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:43,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 89 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:36:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-09 19:36:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1079. [2024-11-09 19:36:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.8079777365491652) internal successors, (1949), 1078 states have internal predecessors, (1949), 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-09 19:36:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1949 transitions. [2024-11-09 19:36:43,892 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1949 transitions. Word has length 227 [2024-11-09 19:36:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:43,893 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1949 transitions. [2024-11-09 19:36:43,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-09 19:36:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1949 transitions. [2024-11-09 19:36:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 19:36:43,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:43,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:36:43,914 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-09 19:36:44,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:44,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:44,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash -863096217, now seen corresponding path program 1 times [2024-11-09 19:36:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:44,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835587066] [2024-11-09 19:36:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:44,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835587066] [2024-11-09 19:36:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835587066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531974244] [2024-11-09 19:36:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:44,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:44,397 INFO L87 Difference]: Start difference. First operand 1079 states and 1949 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-09 19:36:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:45,181 INFO L93 Difference]: Finished difference Result 2693 states and 4925 transitions. [2024-11-09 19:36:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 230 [2024-11-09 19:36:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:45,189 INFO L225 Difference]: With dead ends: 2693 [2024-11-09 19:36:45,189 INFO L226 Difference]: Without dead ends: 1616 [2024-11-09 19:36:45,190 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-09 19:36:45,191 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:45,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 62 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:36:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-09 19:36:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1437. [2024-11-09 19:36:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.7848189415041782) internal successors, (2563), 1436 states have internal predecessors, (2563), 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-09 19:36:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2563 transitions. [2024-11-09 19:36:45,223 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2563 transitions. Word has length 230 [2024-11-09 19:36:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:45,223 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2563 transitions. [2024-11-09 19:36:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-09 19:36:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2563 transitions. [2024-11-09 19:36:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-09 19:36:45,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:45,228 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:45,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:36:45,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -479675721, now seen corresponding path program 1 times [2024-11-09 19:36:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987194784] [2024-11-09 19:36:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 207 proven. 132 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:36:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:45,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987194784] [2024-11-09 19:36:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987194784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973067361] [2024-11-09 19:36:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:45,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:45,667 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-09 19:36:45,670 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-09 19:36:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:45,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:45,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-09 19:36:46,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973067361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:46,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:46,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 19:36:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205562538] [2024-11-09 19:36:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:46,170 INFO L87 Difference]: Start difference. First operand 1437 states and 2563 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-09 19:36:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:46,990 INFO L93 Difference]: Finished difference Result 3230 states and 5842 transitions. [2024-11-09 19:36:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:46,991 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 350 [2024-11-09 19:36:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:46,999 INFO L225 Difference]: With dead ends: 3230 [2024-11-09 19:36:47,000 INFO L226 Difference]: Without dead ends: 1974 [2024-11-09 19:36:47,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:47,003 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 196 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:47,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 50 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:36:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2024-11-09 19:36:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1795. [2024-11-09 19:36:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.7692307692307692) internal successors, (3174), 1794 states have internal predecessors, (3174), 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-09 19:36:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3174 transitions. [2024-11-09 19:36:47,047 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3174 transitions. Word has length 350 [2024-11-09 19:36:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3174 transitions. [2024-11-09 19:36:47,050 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-09 19:36:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3174 transitions. [2024-11-09 19:36:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-11-09 19:36:47,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:47,058 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:47,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:36:47,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 19:36:47,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:47,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1611828145, now seen corresponding path program 1 times [2024-11-09 19:36:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:47,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379354274] [2024-11-09 19:36:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:47,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-09 19:36:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379354274] [2024-11-09 19:36:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379354274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:47,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:47,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046229373] [2024-11-09 19:36:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:47,673 INFO L87 Difference]: Start difference. First operand 1795 states and 3174 transitions. Second operand has 4 states, 4 states have (on average 56.0) 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-09 19:36:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:48,608 INFO L93 Difference]: Finished difference Result 3618 states and 6399 transitions. [2024-11-09 19:36:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:48,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) 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 428 [2024-11-09 19:36:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:48,618 INFO L225 Difference]: With dead ends: 3618 [2024-11-09 19:36:48,619 INFO L226 Difference]: Without dead ends: 1974 [2024-11-09 19:36:48,622 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-09 19:36:48,622 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 255 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:48,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 23 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:36:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2024-11-09 19:36:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1795. [2024-11-09 19:36:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.7190635451505016) internal successors, (3084), 1794 states have internal predecessors, (3084), 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-09 19:36:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3084 transitions. [2024-11-09 19:36:48,660 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3084 transitions. Word has length 428 [2024-11-09 19:36:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:48,661 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3084 transitions. [2024-11-09 19:36:48,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) 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-09 19:36:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3084 transitions. [2024-11-09 19:36:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-11-09 19:36:48,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:48,670 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:48,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:36:48,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:48,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash -870306529, now seen corresponding path program 1 times [2024-11-09 19:36:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:48,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43568182] [2024-11-09 19:36:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:36:49,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:49,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43568182] [2024-11-09 19:36:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43568182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:49,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:49,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050416817] [2024-11-09 19:36:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:49,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:49,080 INFO L87 Difference]: Start difference. First operand 1795 states and 3084 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-09 19:36:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:49,814 INFO L93 Difference]: Finished difference Result 4304 states and 7453 transitions. [2024-11-09 19:36:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:49,814 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 451 [2024-11-09 19:36:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:49,824 INFO L225 Difference]: With dead ends: 4304 [2024-11-09 19:36:49,824 INFO L226 Difference]: Without dead ends: 2690 [2024-11-09 19:36:49,826 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-09 19:36:49,828 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 226 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:49,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 338 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-09 19:36:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2332. [2024-11-09 19:36:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2331 states have (on average 1.7151437151437152) internal successors, (3998), 2331 states have internal predecessors, (3998), 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-09 19:36:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3998 transitions. [2024-11-09 19:36:49,873 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3998 transitions. Word has length 451 [2024-11-09 19:36:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:49,874 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3998 transitions. [2024-11-09 19:36:49,874 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-09 19:36:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3998 transitions. [2024-11-09 19:36:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-11-09 19:36:49,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:49,878 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:49,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:36:49,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:49,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash -272260991, now seen corresponding path program 1 times [2024-11-09 19:36:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:49,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656914479] [2024-11-09 19:36:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 455 proven. 198 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-09 19:36:50,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656914479] [2024-11-09 19:36:50,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656914479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545520612] [2024-11-09 19:36:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:50,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:50,684 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-09 19:36:50,686 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-09 19:36:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:50,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:50,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-09 19:36:50,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545520612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:50,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:36:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640034397] [2024-11-09 19:36:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:50,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:36:50,937 INFO L87 Difference]: Start difference. First operand 2332 states and 3998 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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-09 19:36:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:51,617 INFO L93 Difference]: Finished difference Result 3230 states and 5511 transitions. [2024-11-09 19:36:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:51,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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 454 [2024-11-09 19:36:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:51,631 INFO L225 Difference]: With dead ends: 3230 [2024-11-09 19:36:51,631 INFO L226 Difference]: Without dead ends: 3227 [2024-11-09 19:36:51,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:36:51,633 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:51,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 15 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2024-11-09 19:36:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2332. [2024-11-09 19:36:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2331 states have (on average 1.7151437151437152) internal successors, (3998), 2331 states have internal predecessors, (3998), 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-09 19:36:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3998 transitions. [2024-11-09 19:36:51,683 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3998 transitions. Word has length 454 [2024-11-09 19:36:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:51,684 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3998 transitions. [2024-11-09 19:36:51,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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-09 19:36:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3998 transitions. [2024-11-09 19:36:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-11-09 19:36:51,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:51,688 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:51,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:36:51,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:51,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:51,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -625613065, now seen corresponding path program 1 times [2024-11-09 19:36:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:51,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52239346] [2024-11-09 19:36:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:36:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52239346] [2024-11-09 19:36:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52239346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:52,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249879542] [2024-11-09 19:36:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:52,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:52,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:52,172 INFO L87 Difference]: Start difference. First operand 2332 states and 3998 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-09 19:36:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:52,861 INFO L93 Difference]: Finished difference Result 5199 states and 8986 transitions. [2024-11-09 19:36:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 492 [2024-11-09 19:36:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:52,874 INFO L225 Difference]: With dead ends: 5199 [2024-11-09 19:36:52,874 INFO L226 Difference]: Without dead ends: 3227 [2024-11-09 19:36:52,877 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-09 19:36:52,878 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 188 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:52,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 53 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2024-11-09 19:36:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3227. [2024-11-09 19:36:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3226 states have (on average 1.7114073155610663) internal successors, (5521), 3226 states have internal predecessors, (5521), 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-09 19:36:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 5521 transitions. [2024-11-09 19:36:52,932 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 5521 transitions. Word has length 492 [2024-11-09 19:36:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:52,933 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 5521 transitions. [2024-11-09 19:36:52,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-09 19:36:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 5521 transitions. [2024-11-09 19:36:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-11-09 19:36:52,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:52,937 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:36:52,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash -745850895, now seen corresponding path program 1 times [2024-11-09 19:36:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954854614] [2024-11-09 19:36:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 734 proven. 198 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-09 19:36:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954854614] [2024-11-09 19:36:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954854614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138349352] [2024-11-09 19:36:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:53,727 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-09 19:36:53,728 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-09 19:36:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:53,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:36:53,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-09 19:36:54,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138349352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 19:36:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873617661] [2024-11-09 19:36:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:54,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:36:54,347 INFO L87 Difference]: Start difference. First operand 3227 states and 5521 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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-09 19:36:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:55,039 INFO L93 Difference]: Finished difference Result 7168 states and 12272 transitions. [2024-11-09 19:36:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:55,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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 524 [2024-11-09 19:36:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:55,061 INFO L225 Difference]: With dead ends: 7168 [2024-11-09 19:36:55,062 INFO L226 Difference]: Without dead ends: 4301 [2024-11-09 19:36:55,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:36:55,067 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:55,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 54 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:36:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2024-11-09 19:36:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 3764. [2024-11-09 19:36:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.7090087695987244) internal successors, (6431), 3763 states have internal predecessors, (6431), 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-09 19:36:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 6431 transitions. [2024-11-09 19:36:55,158 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 6431 transitions. Word has length 524 [2024-11-09 19:36:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 3764 states and 6431 transitions. [2024-11-09 19:36:55,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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-09 19:36:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 6431 transitions. [2024-11-09 19:36:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-11-09 19:36:55,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:55,164 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:55,181 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-09 19:36:55,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:55,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:55,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:55,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1141444855, now seen corresponding path program 1 times [2024-11-09 19:36:55,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013623485] [2024-11-09 19:36:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:36:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013623485] [2024-11-09 19:36:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013623485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:55,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:55,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:36:55,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748886524] [2024-11-09 19:36:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:55,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:55,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:55,827 INFO L87 Difference]: Start difference. First operand 3764 states and 6431 transitions. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 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-09 19:36:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:56,852 INFO L93 Difference]: Finished difference Result 8063 states and 13796 transitions. [2024-11-09 19:36:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:56,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 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 529 [2024-11-09 19:36:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:56,870 INFO L225 Difference]: With dead ends: 8063 [2024-11-09 19:36:56,872 INFO L226 Difference]: Without dead ends: 4480 [2024-11-09 19:36:56,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 19:36:56,877 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 442 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:56,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 74 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:36:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2024-11-09 19:36:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3585. [2024-11-09 19:36:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 3584 states have (on average 1.7075892857142858) internal successors, (6120), 3584 states have internal predecessors, (6120), 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-09 19:36:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 6120 transitions. [2024-11-09 19:36:56,951 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 6120 transitions. Word has length 529 [2024-11-09 19:36:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:56,952 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 6120 transitions. [2024-11-09 19:36:56,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 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-09 19:36:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 6120 transitions. [2024-11-09 19:36:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-11-09 19:36:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:56,957 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:56,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:36:56,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1629391027, now seen corresponding path program 1 times [2024-11-09 19:36:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323126358] [2024-11-09 19:36:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-09 19:36:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323126358] [2024-11-09 19:36:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323126358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:57,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976043292] [2024-11-09 19:36:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:57,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:57,420 INFO L87 Difference]: Start difference. First operand 3585 states and 6120 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-09 19:36:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:58,017 INFO L93 Difference]: Finished difference Result 7705 states and 13237 transitions. [2024-11-09 19:36:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:58,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 607 [2024-11-09 19:36:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:58,026 INFO L225 Difference]: With dead ends: 7705 [2024-11-09 19:36:58,026 INFO L226 Difference]: Without dead ends: 4301 [2024-11-09 19:36:58,030 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-09 19:36:58,030 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:58,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 345 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:36:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2024-11-09 19:36:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 3943. [2024-11-09 19:36:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3942 states have (on average 1.7029426686960933) internal successors, (6713), 3942 states have internal predecessors, (6713), 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-09 19:36:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 6713 transitions. [2024-11-09 19:36:58,083 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 6713 transitions. Word has length 607 [2024-11-09 19:36:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:58,084 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 6713 transitions. [2024-11-09 19:36:58,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-09 19:36:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 6713 transitions. [2024-11-09 19:36:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2024-11-09 19:36:58,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:58,110 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2024-11-09 19:36:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:36:58,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:58,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -358651767, now seen corresponding path program 1 times [2024-11-09 19:36:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139703423] [2024-11-09 19:36:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 903 proven. 111 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:36:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139703423] [2024-11-09 19:36:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139703423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327158379] [2024-11-09 19:36:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:58,551 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-09 19:36:58,552 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-09 19:36:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:58,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:36:58,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 903 proven. 111 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:36:59,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:36:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 903 proven. 111 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:36:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327158379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:36:59,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:36:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-09 19:36:59,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741328135] [2024-11-09 19:36:59,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:36:59,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 19:36:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 19:36:59,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:59,445 INFO L87 Difference]: Start difference. First operand 3943 states and 6713 transitions. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 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-09 19:37:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:00,626 INFO L93 Difference]: Finished difference Result 9495 states and 16210 transitions. [2024-11-09 19:37:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 19:37:00,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 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 648 [2024-11-09 19:37:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:00,638 INFO L225 Difference]: With dead ends: 9495 [2024-11-09 19:37:00,638 INFO L226 Difference]: Without dead ends: 5733 [2024-11-09 19:37:00,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1298 GetRequests, 1294 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:37:00,643 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 652 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:00,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 74 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:37:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2024-11-09 19:37:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 4838. [2024-11-09 19:37:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4838 states, 4837 states have (on average 1.7014678519743642) internal successors, (8230), 4837 states have internal predecessors, (8230), 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-09 19:37:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 8230 transitions. [2024-11-09 19:37:00,708 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 8230 transitions. Word has length 648 [2024-11-09 19:37:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:00,708 INFO L471 AbstractCegarLoop]: Abstraction has 4838 states and 8230 transitions. [2024-11-09 19:37:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 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-09 19:37:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 8230 transitions. [2024-11-09 19:37:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2024-11-09 19:37:00,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:37:00,715 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 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-09 19:37:00,732 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-09 19:37:00,915 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,SelfDestructingSolverStorable14 [2024-11-09 19:37:00,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:37:00,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:37:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -355975407, now seen corresponding path program 1 times [2024-11-09 19:37:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:37:00,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297798977] [2024-11-09 19:37:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:37:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 808 proven. 258 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2024-11-09 19:37:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:37:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297798977] [2024-11-09 19:37:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297798977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:37:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882863631] [2024-11-09 19:37:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:02,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:37:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:37:02,086 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-09 19:37:02,087 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-09 19:37:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:02,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:37:02,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:37:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2024-11-09 19:37:03,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:37:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882863631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:37:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:37:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 19:37:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405159116] [2024-11-09 19:37:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:37:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:37:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:37:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:37:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:37:03,240 INFO L87 Difference]: Start difference. First operand 4838 states and 8230 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 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-09 19:37:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:04,124 INFO L93 Difference]: Finished difference Result 10032 states and 17108 transitions. [2024-11-09 19:37:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:37:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 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 777 [2024-11-09 19:37:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:04,135 INFO L225 Difference]: With dead ends: 10032 [2024-11-09 19:37:04,135 INFO L226 Difference]: Without dead ends: 5196 [2024-11-09 19:37:04,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:37:04,141 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 358 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:04,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 54 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:37:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2024-11-09 19:37:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5017. [2024-11-09 19:37:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 5016 states have (on average 1.69377990430622) internal successors, (8496), 5016 states have internal predecessors, (8496), 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-09 19:37:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 8496 transitions. [2024-11-09 19:37:04,206 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 8496 transitions. Word has length 777 [2024-11-09 19:37:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 5017 states and 8496 transitions. [2024-11-09 19:37:04,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 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-09 19:37:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 8496 transitions. [2024-11-09 19:37:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2024-11-09 19:37:04,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:37:04,214 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2024-11-09 19:37:04,232 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-09 19:37:04,414 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,SelfDestructingSolverStorable15 [2024-11-09 19:37:04,415 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:37:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:37:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1139380621, now seen corresponding path program 1 times [2024-11-09 19:37:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:37:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528061362] [2024-11-09 19:37:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:37:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 1232 proven. 73 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-09 19:37:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:37:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528061362] [2024-11-09 19:37:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528061362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:37:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727466713] [2024-11-09 19:37:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:05,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:37:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:37:05,885 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-09 19:37:05,887 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-09 19:37:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:06,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:37:06,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:37:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 1354 proven. 510 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-11-09 19:37:07,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:37:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 1305 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-09 19:37:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727466713] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:37:08,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:37:08,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 13 [2024-11-09 19:37:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556162438] [2024-11-09 19:37:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:37:08,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:37:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:37:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:37:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 19:37:08,195 INFO L87 Difference]: Start difference. First operand 5017 states and 8496 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 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-09 19:37:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:09,107 INFO L93 Difference]: Finished difference Result 10211 states and 17315 transitions. [2024-11-09 19:37:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:37:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 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 817 [2024-11-09 19:37:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:09,117 INFO L225 Difference]: With dead ends: 10211 [2024-11-09 19:37:09,117 INFO L226 Difference]: Without dead ends: 5375 [2024-11-09 19:37:09,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1637 GetRequests, 1626 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 19:37:09,122 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 830 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:09,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 14 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:37:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2024-11-09 19:37:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5017. [2024-11-09 19:37:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 5016 states have (on average 1.694377990430622) internal successors, (8499), 5016 states have internal predecessors, (8499), 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-09 19:37:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 8499 transitions. [2024-11-09 19:37:09,184 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 8499 transitions. Word has length 817 [2024-11-09 19:37:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 5017 states and 8499 transitions. [2024-11-09 19:37:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 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-09 19:37:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 8499 transitions. [2024-11-09 19:37:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-09 19:37:09,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:37:09,192 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:37:09,210 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-09 19:37:09,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:37:09,393 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:37:09,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:37:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1240301483, now seen corresponding path program 1 times [2024-11-09 19:37:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:37:09,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909536786] [2024-11-09 19:37:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:37:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 1268 proven. 73 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-09 19:37:10,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:37:10,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909536786] [2024-11-09 19:37:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909536786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:37:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696295185] [2024-11-09 19:37:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:10,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:37:10,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:37:10,660 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-09 19:37:10,661 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-09 19:37:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:10,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:37:10,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:37:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 1357 proven. 543 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-11-09 19:37:11,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:37:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 1341 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-09 19:37:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696295185] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:37:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:37:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 13 [2024-11-09 19:37:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133542589] [2024-11-09 19:37:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:37:12,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:37:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:37:12,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:37:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 19:37:12,575 INFO L87 Difference]: Start difference. First operand 5017 states and 8499 transitions. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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-09 19:37:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:13,293 INFO L93 Difference]: Finished difference Result 10211 states and 17301 transitions. [2024-11-09 19:37:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:37:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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 850 [2024-11-09 19:37:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:13,304 INFO L225 Difference]: With dead ends: 10211 [2024-11-09 19:37:13,305 INFO L226 Difference]: Without dead ends: 5375 [2024-11-09 19:37:13,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1703 GetRequests, 1692 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 19:37:13,310 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 731 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:13,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 14 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:37:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2024-11-09 19:37:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5017. [2024-11-09 19:37:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 5016 states have (on average 1.694377990430622) internal successors, (8499), 5016 states have internal predecessors, (8499), 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-09 19:37:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 8499 transitions. [2024-11-09 19:37:13,379 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 8499 transitions. Word has length 850 [2024-11-09 19:37:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:13,380 INFO L471 AbstractCegarLoop]: Abstraction has 5017 states and 8499 transitions. [2024-11-09 19:37:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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-09 19:37:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 8499 transitions. [2024-11-09 19:37:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2024-11-09 19:37:13,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:37:13,391 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:37:13,410 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-09 19:37:13,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 19:37:13,592 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:37:13,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:37:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash -895641095, now seen corresponding path program 1 times [2024-11-09 19:37:13,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:37:13,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404257042] [2024-11-09 19:37:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:37:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3031 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 2624 trivial. 0 not checked. [2024-11-09 19:37:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:37:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404257042] [2024-11-09 19:37:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404257042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:37:14,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:37:14,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:37:14,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470941063] [2024-11-09 19:37:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:37:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:37:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:37:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:37:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:37:14,327 INFO L87 Difference]: Start difference. First operand 5017 states and 8499 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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-09 19:37:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:15,153 INFO L93 Difference]: Finished difference Result 10055 states and 17005 transitions. [2024-11-09 19:37:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:37:15,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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 983 [2024-11-09 19:37:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:15,161 INFO L225 Difference]: With dead ends: 10055 [2024-11-09 19:37:15,161 INFO L226 Difference]: Without dead ends: 5017 [2024-11-09 19:37:15,166 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-09 19:37:15,167 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 162 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:15,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 23 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:37:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2024-11-09 19:37:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4838. [2024-11-09 19:37:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4838 states, 4837 states have (on average 1.6917510853835023) internal successors, (8183), 4837 states have internal predecessors, (8183), 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-09 19:37:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 8183 transitions. [2024-11-09 19:37:15,233 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 8183 transitions. Word has length 983 [2024-11-09 19:37:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:15,234 INFO L471 AbstractCegarLoop]: Abstraction has 4838 states and 8183 transitions. [2024-11-09 19:37:15,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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-09 19:37:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 8183 transitions. [2024-11-09 19:37:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2024-11-09 19:37:15,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:37:15,246 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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] [2024-11-09 19:37:15,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:37:15,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:37:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:37:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash 867624757, now seen corresponding path program 1 times [2024-11-09 19:37:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:37:15,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979717974] [2024-11-09 19:37:15,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:37:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3801 backedges. 1798 proven. 0 refuted. 0 times theorem prover too weak. 2003 trivial. 0 not checked. [2024-11-09 19:37:15,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:37:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979717974] [2024-11-09 19:37:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979717974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:37:15,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:37:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:37:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385468166] [2024-11-09 19:37:15,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:37:15,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:37:15,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:37:15,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:37:15,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:37:15,940 INFO L87 Difference]: Start difference. First operand 4838 states and 8183 transitions. Second operand has 7 states, 7 states have (on average 49.42857142857143) internal successors, (346), 6 states have internal predecessors, (346), 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-09 19:37:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:16,638 INFO L93 Difference]: Finished difference Result 9597 states and 16165 transitions. [2024-11-09 19:37:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:37:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.42857142857143) internal successors, (346), 6 states have internal predecessors, (346), 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 1026 [2024-11-09 19:37:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:16,649 INFO L225 Difference]: With dead ends: 9597 [2024-11-09 19:37:16,650 INFO L226 Difference]: Without dead ends: 4710 [2024-11-09 19:37:16,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:37:16,656 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 166 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:16,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 25 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:37:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2024-11-09 19:37:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 4710. [2024-11-09 19:37:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4710 states, 4709 states have (on average 1.6744531747717137) internal successors, (7885), 4709 states have internal predecessors, (7885), 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-09 19:37:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 7885 transitions. [2024-11-09 19:37:16,734 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 7885 transitions. Word has length 1026 [2024-11-09 19:37:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:16,735 INFO L471 AbstractCegarLoop]: Abstraction has 4710 states and 7885 transitions. [2024-11-09 19:37:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.42857142857143) internal successors, (346), 6 states have internal predecessors, (346), 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-09 19:37:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 7885 transitions. [2024-11-09 19:37:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2024-11-09 19:37:16,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:37:16,747 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:37:16,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:37:16,748 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:37:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:37:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1046523455, now seen corresponding path program 1 times [2024-11-09 19:37:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:37:16,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849652842] [2024-11-09 19:37:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:37:16,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:37:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:37:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 1184 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2024-11-09 19:37:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:37:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849652842] [2024-11-09 19:37:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849652842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:37:17,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:37:17,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:37:17,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078711105] [2024-11-09 19:37:17,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:37:17,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:37:17,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:37:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:37:17,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:37:17,158 INFO L87 Difference]: Start difference. First operand 4710 states and 7885 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-09 19:37:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:37:17,711 INFO L93 Difference]: Finished difference Result 9952 states and 16671 transitions. [2024-11-09 19:37:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:37:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 1058 [2024-11-09 19:37:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:37:17,712 INFO L225 Difference]: With dead ends: 9952 [2024-11-09 19:37:17,712 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:37:17,717 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-09 19:37:17,718 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 197 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:37:17,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 336 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:37:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:37:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:37:17,719 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-09 19:37:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:37:17,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1058 [2024-11-09 19:37:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:37:17,719 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:37:17,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-09 19:37:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:37:17,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:37:17,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:37:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:37:17,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:37:17,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:37:18,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:37:18,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:37:18 BoogieIcfgContainer [2024-11-09 19:37:18,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:37:18,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:37:18,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:37:18,122 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:37:18,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:36" (3/4) ... [2024-11-09 19:37:18,126 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:37:18,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:37:18,153 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:37:18,154 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:37:18,155 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:37:18,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:37:18,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:37:18,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:37:18,320 INFO L158 Benchmark]: Toolchain (without parser) took 44530.43ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 882.9MB). Free memory was 98.9MB in the beginning and 470.5MB in the end (delta: -371.6MB). Peak memory consumption was 513.1MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,320 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:37:18,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.59ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 128.9MB in the end (delta: -30.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.11ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 118.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,321 INFO L158 Benchmark]: Boogie Preprocessor took 113.92ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 106.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,321 INFO L158 Benchmark]: IcfgBuilder took 1606.45ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 106.9MB in the beginning and 178.0MB in the end (delta: -71.1MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,321 INFO L158 Benchmark]: TraceAbstraction took 41838.72ms. Allocated memory was 228.6MB in the beginning and 1.1GB in the end (delta: 826.3MB). Free memory was 177.0MB in the beginning and 488.3MB in the end (delta: -311.3MB). Peak memory consumption was 515.0MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,322 INFO L158 Benchmark]: Witness Printer took 197.01ms. Allocated memory is still 1.1GB. Free memory was 488.3MB in the beginning and 470.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:37:18,327 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.59ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 128.9MB in the end (delta: -30.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.11ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 118.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.92ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 106.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1606.45ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 106.9MB in the beginning and 178.0MB in the end (delta: -71.1MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41838.72ms. Allocated memory was 228.6MB in the beginning and 1.1GB in the end (delta: 826.3MB). Free memory was 177.0MB in the beginning and 488.3MB in the end (delta: -311.3MB). Peak memory consumption was 515.0MB. Max. memory is 16.1GB. * Witness Printer took 197.01ms. Allocated memory is still 1.1GB. Free memory was 488.3MB in the beginning and 470.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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: 170]: 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, 248 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7051 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7051 mSDsluCounter, 2070 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 1366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18354 IncrementalHoareTripleChecker+Invalid, 19720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1366 mSolverCounterUnsat, 1894 mSDtfsCounter, 18354 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7032 GetRequests, 6958 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5017occurred in iteration=16, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 6086 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 15621 NumberOfCodeBlocks, 15621 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 17904 ConstructedInterpolants, 248 QuantifiedInterpolants, 58661 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5888 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 39205/41589 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: 890]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:37:18,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE