./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem16_label23.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 8d85db598b116be798c82f2dd8d1706b14592e07af324ce511eec8d5748ab1b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:12:27,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:12:27,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:12:27,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:12:27,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:12:27,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:12:27,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:12:27,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:12:27,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:12:27,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:12:27,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:12:27,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:12:27,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:12:27,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:12:27,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:12:27,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:12:27,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:12:27,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:12:27,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:12:27,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:12:27,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:12:27,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:12:27,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:12:27,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:12:27,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:12:27,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:12:27,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:12:27,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:12:27,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:12:27,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:12:27,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:12:27,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:12:27,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:12:27,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:12:27,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:12:27,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:12:27,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:12:27,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:12:27,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:12:27,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:12:27,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:12:27,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:12:27,792 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 -> 8d85db598b116be798c82f2dd8d1706b14592e07af324ce511eec8d5748ab1b3 [2024-11-11 17:12:28,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:12:28,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:12:28,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:12:28,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:12:28,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:12:28,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label23.c [2024-11-11 17:12:29,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:12:29,852 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:12:29,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label23.c [2024-11-11 17:12:29,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00d262a7/a9f8a8f23c6e41a38b511dee74914aac/FLAG019d7c0f8 [2024-11-11 17:12:29,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00d262a7/a9f8a8f23c6e41a38b511dee74914aac [2024-11-11 17:12:29,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:12:29,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:12:29,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:12:29,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:12:29,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:12:29,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:12:29" (1/1) ... [2024-11-11 17:12:29,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c85711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:29, skipping insertion in model container [2024-11-11 17:12:29,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:12:29" (1/1) ... [2024-11-11 17:12:29,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:12:30,266 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/Problem16_label23.c[3431,3444] [2024-11-11 17:12:30,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:12:30,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:12:30,642 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/Problem16_label23.c[3431,3444] [2024-11-11 17:12:30,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:12:30,794 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:12:30,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30 WrapperNode [2024-11-11 17:12:30,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:12:30,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:12:30,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:12:30,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:12:30,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:30,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:30,948 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-11 17:12:30,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:12:30,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:12:30,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:12:30,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:12:30,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:30,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,169 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-11 17:12:31,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:12:31,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:12:31,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:12:31,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:12:31,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (1/1) ... [2024-11-11 17:12:31,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:12:31,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:12:31,351 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-11 17:12:31,354 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-11 17:12:31,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:12:31,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:12:31,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:12:31,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:12:31,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:12:31,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:12:33,389 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-11 17:12:33,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:12:33,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:12:33,422 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:12:33,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:12:33 BoogieIcfgContainer [2024-11-11 17:12:33,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:12:33,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:12:33,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:12:33,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:12:33,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:12:29" (1/3) ... [2024-11-11 17:12:33,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b13ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:12:33, skipping insertion in model container [2024-11-11 17:12:33,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:30" (2/3) ... [2024-11-11 17:12:33,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b13ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:12:33, skipping insertion in model container [2024-11-11 17:12:33,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:12:33" (3/3) ... [2024-11-11 17:12:33,432 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label23.c [2024-11-11 17:12:33,451 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:12:33,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:12:33,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:12:33,539 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;@5b116358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:12:33,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:12:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 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-11 17:12:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 17:12:33,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:33,554 INFO L218 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] [2024-11-11 17:12:33,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:33,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1843609039, now seen corresponding path program 1 times [2024-11-11 17:12:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:33,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130589099] [2024-11-11 17:12:33,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:33,917 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-11 17:12:33,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130589099] [2024-11-11 17:12:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130589099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:33,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:12:33,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708899655] [2024-11-11 17:12:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:33,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:33,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:33,955 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 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 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-11 17:12:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:35,630 INFO L93 Difference]: Finished difference Result 1137 states and 2118 transitions. [2024-11-11 17:12:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2024-11-11 17:12:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:35,648 INFO L225 Difference]: With dead ends: 1137 [2024-11-11 17:12:35,648 INFO L226 Difference]: Without dead ends: 662 [2024-11-11 17:12:35,653 INFO L434 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-11 17:12:35,656 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 355 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:35,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 17:12:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-11 17:12:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-11 17:12:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 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-11 17:12:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2024-11-11 17:12:35,747 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 31 [2024-11-11 17:12:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:35,748 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2024-11-11 17:12:35,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-11 17:12:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2024-11-11 17:12:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 17:12:35,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:35,752 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:12:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:12:35,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 357086092, now seen corresponding path program 1 times [2024-11-11 17:12:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:35,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425934680] [2024-11-11 17:12:35,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:12:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425934680] [2024-11-11 17:12:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425934680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:35,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:35,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:12:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18109406] [2024-11-11 17:12:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:35,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:35,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:35,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:35,993 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-11 17:12:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:37,290 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2024-11-11 17:12:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2024-11-11 17:12:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:37,297 INFO L225 Difference]: With dead ends: 1980 [2024-11-11 17:12:37,297 INFO L226 Difference]: Without dead ends: 1320 [2024-11-11 17:12:37,299 INFO L434 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-11 17:12:37,301 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:37,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:12:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-11 17:12:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2024-11-11 17:12:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 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-11 17:12:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2024-11-11 17:12:37,359 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 96 [2024-11-11 17:12:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:37,360 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2024-11-11 17:12:37,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-11 17:12:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2024-11-11 17:12:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 17:12:37,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:37,362 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:12:37,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:12:37,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1175667850, now seen corresponding path program 1 times [2024-11-11 17:12:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543780182] [2024-11-11 17:12:37,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:12:37,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543780182] [2024-11-11 17:12:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543780182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:37,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:12:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946063820] [2024-11-11 17:12:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:37,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:37,585 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-11 17:12:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:38,994 INFO L93 Difference]: Finished difference Result 3625 states and 6017 transitions. [2024-11-11 17:12:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2024-11-11 17:12:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:39,002 INFO L225 Difference]: With dead ends: 3625 [2024-11-11 17:12:39,003 INFO L226 Difference]: Without dead ends: 2307 [2024-11-11 17:12:39,004 INFO L434 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-11 17:12:39,005 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 282 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:39,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 120 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:12:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2024-11-11 17:12:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2024-11-11 17:12:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5923677363399826) internal successors, (3672), 2306 states have internal predecessors, (3672), 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-11 17:12:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3672 transitions. [2024-11-11 17:12:39,045 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3672 transitions. Word has length 99 [2024-11-11 17:12:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:39,046 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3672 transitions. [2024-11-11 17:12:39,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-11 17:12:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3672 transitions. [2024-11-11 17:12:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 17:12:39,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:39,048 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:12:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:12:39,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1706439456, now seen corresponding path program 1 times [2024-11-11 17:12:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108712214] [2024-11-11 17:12:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:12:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:39,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108712214] [2024-11-11 17:12:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108712214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:39,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638347025] [2024-11-11 17:12:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:12:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:12:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:12:39,241 INFO L87 Difference]: Start difference. First operand 2307 states and 3672 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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-11 17:12:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:41,266 INFO L93 Difference]: Finished difference Result 6257 states and 9781 transitions. [2024-11-11 17:12:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:12:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2024-11-11 17:12:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:41,279 INFO L225 Difference]: With dead ends: 6257 [2024-11-11 17:12:41,280 INFO L226 Difference]: Without dead ends: 3952 [2024-11-11 17:12:41,283 INFO L434 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-11 17:12:41,284 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 886 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:41,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 191 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 17:12:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-11 17:12:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-11 17:12:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.4312832194381169) internal successors, (5655), 3951 states have internal predecessors, (5655), 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-11 17:12:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5655 transitions. [2024-11-11 17:12:41,355 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5655 transitions. Word has length 104 [2024-11-11 17:12:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5655 transitions. [2024-11-11 17:12:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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-11 17:12:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5655 transitions. [2024-11-11 17:12:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 17:12:41,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:41,358 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:12:41,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:12:41,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:41,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash 478482531, now seen corresponding path program 1 times [2024-11-11 17:12:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:41,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930440871] [2024-11-11 17:12:41,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:41,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 17:12:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930440871] [2024-11-11 17:12:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930440871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:41,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:41,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:12:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822018366] [2024-11-11 17:12:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:41,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:41,478 INFO L87 Difference]: Start difference. First operand 3952 states and 5655 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-11 17:12:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:42,747 INFO L93 Difference]: Finished difference Result 10534 states and 15398 transitions. [2024-11-11 17:12:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 118 [2024-11-11 17:12:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:42,771 INFO L225 Difference]: With dead ends: 10534 [2024-11-11 17:12:42,772 INFO L226 Difference]: Without dead ends: 6913 [2024-11-11 17:12:42,778 INFO L434 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-11 17:12:42,780 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 265 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:42,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 223 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:12:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2024-11-11 17:12:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6913. [2024-11-11 17:12:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.3081597222222223) internal successors, (9042), 6912 states have internal predecessors, (9042), 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-11 17:12:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 9042 transitions. [2024-11-11 17:12:42,925 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 9042 transitions. Word has length 118 [2024-11-11 17:12:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:42,926 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 9042 transitions. [2024-11-11 17:12:42,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-11 17:12:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 9042 transitions. [2024-11-11 17:12:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-11 17:12:42,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:42,930 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:12:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:12:42,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 888355746, now seen corresponding path program 1 times [2024-11-11 17:12:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047274388] [2024-11-11 17:12:42,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-11 17:12:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:43,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047274388] [2024-11-11 17:12:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047274388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:43,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:12:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575993073] [2024-11-11 17:12:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:43,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:43,151 INFO L87 Difference]: Start difference. First operand 6913 states and 9042 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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-11 17:12:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:44,239 INFO L93 Difference]: Finished difference Result 16456 states and 21659 transitions. [2024-11-11 17:12:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:44,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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 265 [2024-11-11 17:12:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:44,269 INFO L225 Difference]: With dead ends: 16456 [2024-11-11 17:12:44,270 INFO L226 Difference]: Without dead ends: 9874 [2024-11-11 17:12:44,277 INFO L434 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-11 17:12:44,278 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:44,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:12:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2024-11-11 17:12:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 8229. [2024-11-11 17:12:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.2035731648031114) internal successors, (9903), 8228 states have internal predecessors, (9903), 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-11 17:12:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 9903 transitions. [2024-11-11 17:12:44,411 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 9903 transitions. Word has length 265 [2024-11-11 17:12:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:44,415 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 9903 transitions. [2024-11-11 17:12:44,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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-11 17:12:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 9903 transitions. [2024-11-11 17:12:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-11 17:12:44,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:44,420 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:12:44,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:12:44,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:44,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash 202313507, now seen corresponding path program 1 times [2024-11-11 17:12:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:44,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614101236] [2024-11-11 17:12:44,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:12:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614101236] [2024-11-11 17:12:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614101236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 17:12:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071201025] [2024-11-11 17:12:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 17:12:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 17:12:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:12:45,031 INFO L87 Difference]: Start difference. First operand 8229 states and 9903 transitions. Second operand has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 6 states have internal predecessors, (353), 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-11 17:12:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:46,523 INFO L93 Difference]: Finished difference Result 15717 states and 19011 transitions. [2024-11-11 17:12:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 17:12:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 6 states have internal predecessors, (353), 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 353 [2024-11-11 17:12:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:46,539 INFO L225 Difference]: With dead ends: 15717 [2024-11-11 17:12:46,540 INFO L226 Difference]: Without dead ends: 7900 [2024-11-11 17:12:46,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:12:46,549 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:46,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 291 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:12:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2024-11-11 17:12:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2024-11-11 17:12:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0845676667932649) internal successors, (8567), 7899 states have internal predecessors, (8567), 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-11 17:12:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8567 transitions. [2024-11-11 17:12:46,689 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8567 transitions. Word has length 353 [2024-11-11 17:12:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:46,690 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8567 transitions. [2024-11-11 17:12:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 6 states have internal predecessors, (353), 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-11 17:12:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8567 transitions. [2024-11-11 17:12:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-11 17:12:46,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:46,696 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:12:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:12:46,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:46,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1300314316, now seen corresponding path program 1 times [2024-11-11 17:12:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043629546] [2024-11-11 17:12:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-11 17:12:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043629546] [2024-11-11 17:12:47,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043629546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:47,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:47,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:47,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527606777] [2024-11-11 17:12:47,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:47,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:47,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:47,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:47,001 INFO L87 Difference]: Start difference. First operand 7900 states and 8567 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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-11 17:12:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:47,947 INFO L93 Difference]: Finished difference Result 18101 states and 19824 transitions. [2024-11-11 17:12:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 370 [2024-11-11 17:12:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:47,973 INFO L225 Difference]: With dead ends: 18101 [2024-11-11 17:12:47,973 INFO L226 Difference]: Without dead ends: 10861 [2024-11-11 17:12:47,981 INFO L434 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-11 17:12:47,983 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 304 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:47,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 405 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 17:12:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2024-11-11 17:12:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2024-11-11 17:12:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0780847145488028) internal successors, (11708), 10860 states have internal predecessors, (11708), 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-11 17:12:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11708 transitions. [2024-11-11 17:12:48,194 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11708 transitions. Word has length 370 [2024-11-11 17:12:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:48,195 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11708 transitions. [2024-11-11 17:12:48,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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-11 17:12:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11708 transitions. [2024-11-11 17:12:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2024-11-11 17:12:48,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:48,212 INFO L218 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:12:48,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:12:48,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:48,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash -412346964, now seen corresponding path program 1 times [2024-11-11 17:12:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669039946] [2024-11-11 17:12:48,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 17:12:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669039946] [2024-11-11 17:12:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669039946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:48,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:48,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:48,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87092208] [2024-11-11 17:12:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:48,701 INFO L87 Difference]: Start difference. First operand 10861 states and 11708 transitions. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-11 17:12:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:49,555 INFO L93 Difference]: Finished difference Result 21062 states and 22744 transitions. [2024-11-11 17:12:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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 565 [2024-11-11 17:12:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:49,576 INFO L225 Difference]: With dead ends: 21062 [2024-11-11 17:12:49,576 INFO L226 Difference]: Without dead ends: 10861 [2024-11-11 17:12:49,585 INFO L434 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-11 17:12:49,586 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:49,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 60 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:12:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2024-11-11 17:12:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2024-11-11 17:12:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0667587476979743) internal successors, (11585), 10860 states have internal predecessors, (11585), 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-11 17:12:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11585 transitions. [2024-11-11 17:12:49,700 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11585 transitions. Word has length 565 [2024-11-11 17:12:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:49,700 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11585 transitions. [2024-11-11 17:12:49,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-11 17:12:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11585 transitions. [2024-11-11 17:12:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2024-11-11 17:12:49,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:49,709 INFO L218 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:12:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:12:49,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1358447523, now seen corresponding path program 1 times [2024-11-11 17:12:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239904247] [2024-11-11 17:12:49,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 17:12:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239904247] [2024-11-11 17:12:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239904247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031590095] [2024-11-11 17:12:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:50,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:12:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:50,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:12:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:12:50,540 INFO L87 Difference]: Start difference. First operand 10861 states and 11585 transitions. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 3 states have internal predecessors, (623), 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-11 17:12:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:51,761 INFO L93 Difference]: Finished difference Result 21062 states and 22500 transitions. [2024-11-11 17:12:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:12:51,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 3 states have internal predecessors, (623), 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 651 [2024-11-11 17:12:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:51,777 INFO L225 Difference]: With dead ends: 21062 [2024-11-11 17:12:51,777 INFO L226 Difference]: Without dead ends: 10861 [2024-11-11 17:12:51,786 INFO L434 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-11 17:12:51,787 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 270 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:51,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 86 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:12:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2024-11-11 17:12:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2024-11-11 17:12:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0629834254143646) internal successors, (11544), 10860 states have internal predecessors, (11544), 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-11 17:12:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11544 transitions. [2024-11-11 17:12:51,928 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11544 transitions. Word has length 651 [2024-11-11 17:12:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:51,930 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11544 transitions. [2024-11-11 17:12:51,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 3 states have internal predecessors, (623), 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-11 17:12:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11544 transitions. [2024-11-11 17:12:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2024-11-11 17:12:51,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:51,940 INFO L218 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, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:12:51,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:12:51,941 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 661033144, now seen corresponding path program 1 times [2024-11-11 17:12:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:51,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558844566] [2024-11-11 17:12:51,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-11 17:12:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558844566] [2024-11-11 17:12:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558844566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:52,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071078356] [2024-11-11 17:12:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:52,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:52,746 INFO L87 Difference]: Start difference. First operand 10861 states and 11544 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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-11 17:12:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:53,445 INFO L93 Difference]: Finished difference Result 24352 states and 25917 transitions. [2024-11-11 17:12:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 701 [2024-11-11 17:12:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:53,466 INFO L225 Difference]: With dead ends: 24352 [2024-11-11 17:12:53,466 INFO L226 Difference]: Without dead ends: 14151 [2024-11-11 17:12:53,477 INFO L434 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-11 17:12:53,478 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 224 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:53,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 38 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:12:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2024-11-11 17:12:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13493. [2024-11-11 17:12:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0578120367625259) internal successors, (14272), 13492 states have internal predecessors, (14272), 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-11 17:12:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 14272 transitions. [2024-11-11 17:12:53,696 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 14272 transitions. Word has length 701 [2024-11-11 17:12:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:53,697 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 14272 transitions. [2024-11-11 17:12:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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-11 17:12:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 14272 transitions. [2024-11-11 17:12:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2024-11-11 17:12:53,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:53,709 INFO L218 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, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:12:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:12:53,709 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:53,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1461292433, now seen corresponding path program 1 times [2024-11-11 17:12:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245749618] [2024-11-11 17:12:53,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 873 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-11-11 17:12:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245749618] [2024-11-11 17:12:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245749618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:54,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416602519] [2024-11-11 17:12:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:54,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:12:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:12:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:12:54,681 INFO L87 Difference]: Start difference. First operand 13493 states and 14272 transitions. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 3 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-11 17:12:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:55,549 INFO L93 Difference]: Finished difference Result 26326 states and 27875 transitions. [2024-11-11 17:12:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:55,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 3 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) Word has length 755 [2024-11-11 17:12:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:55,563 INFO L225 Difference]: With dead ends: 26326 [2024-11-11 17:12:55,563 INFO L226 Difference]: Without dead ends: 13493 [2024-11-11 17:12:55,574 INFO L434 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-11 17:12:55,575 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 118 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:12:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2024-11-11 17:12:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2024-11-11 17:12:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0575896827749778) internal successors, (14269), 13492 states have internal predecessors, (14269), 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-11 17:12:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 14269 transitions. [2024-11-11 17:12:55,723 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 14269 transitions. Word has length 755 [2024-11-11 17:12:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:55,724 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 14269 transitions. [2024-11-11 17:12:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 3 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-11 17:12:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 14269 transitions. [2024-11-11 17:12:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2024-11-11 17:12:55,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:55,800 INFO L218 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, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 17:12:55,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:12:55,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:55,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1459862461, now seen corresponding path program 1 times [2024-11-11 17:12:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916365598] [2024-11-11 17:12:55,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-11 17:12:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916365598] [2024-11-11 17:12:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916365598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:12:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:12:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299787808] [2024-11-11 17:12:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:56,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:56,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:12:56,386 INFO L87 Difference]: Start difference. First operand 13493 states and 14269 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-11 17:12:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:12:57,254 INFO L93 Difference]: Finished difference Result 28958 states and 30688 transitions. [2024-11-11 17:12:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:12:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 816 [2024-11-11 17:12:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:12:57,277 INFO L225 Difference]: With dead ends: 28958 [2024-11-11 17:12:57,277 INFO L226 Difference]: Without dead ends: 16125 [2024-11-11 17:12:57,289 INFO L434 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-11 17:12:57,291 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:12:57,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 443 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:12:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2024-11-11 17:12:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 15796. [2024-11-11 17:12:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0549540993985438) internal successors, (16663), 15795 states have internal predecessors, (16663), 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-11 17:12:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16663 transitions. [2024-11-11 17:12:57,519 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16663 transitions. Word has length 816 [2024-11-11 17:12:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:12:57,520 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16663 transitions. [2024-11-11 17:12:57,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-11 17:12:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16663 transitions. [2024-11-11 17:12:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-11-11 17:12:57,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:12:57,540 INFO L218 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, 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, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:12:57,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:12:57,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:12:57,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:12:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash 579852588, now seen corresponding path program 1 times [2024-11-11 17:12:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:12:57,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891374894] [2024-11-11 17:12:57,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:12:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1315 backedges. 908 proven. 258 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-11 17:12:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:12:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891374894] [2024-11-11 17:12:58,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891374894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:12:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617194351] [2024-11-11 17:12:58,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:12:58,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:12:58,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:12:58,976 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-11 17:12:58,977 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-11 17:12:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:12:59,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:12:59,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:12:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1315 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2024-11-11 17:12:59,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:12:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617194351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:12:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:12:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-11 17:12:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969337642] [2024-11-11 17:12:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:12:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:12:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:12:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:12:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:12:59,349 INFO L87 Difference]: Start difference. First operand 15796 states and 16663 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11 17:13:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:00,228 INFO L93 Difference]: Finished difference Result 30932 states and 32660 transitions. [2024-11-11 17:13:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 846 [2024-11-11 17:13:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:00,246 INFO L225 Difference]: With dead ends: 30932 [2024-11-11 17:13:00,247 INFO L226 Difference]: Without dead ends: 15796 [2024-11-11 17:13:00,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:13:00,259 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 336 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:00,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 377 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:13:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2024-11-11 17:13:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15796. [2024-11-11 17:13:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0465337132003798) internal successors, (16530), 15795 states have internal predecessors, (16530), 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-11 17:13:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16530 transitions. [2024-11-11 17:13:00,420 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16530 transitions. Word has length 846 [2024-11-11 17:13:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:00,421 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16530 transitions. [2024-11-11 17:13:00,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-11 17:13:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16530 transitions. [2024-11-11 17:13:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2024-11-11 17:13:00,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:00,435 INFO L218 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2024-11-11 17:13:00,454 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-11 17:13:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 17:13:00,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1545547188, now seen corresponding path program 1 times [2024-11-11 17:13:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997539643] [2024-11-11 17:13:00,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-11-11 17:13:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997539643] [2024-11-11 17:13:01,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997539643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:01,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:01,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250783363] [2024-11-11 17:13:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:01,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:01,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:01,271 INFO L87 Difference]: Start difference. First operand 15796 states and 16530 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-11 17:13:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:01,953 INFO L93 Difference]: Finished difference Result 30932 states and 32394 transitions. [2024-11-11 17:13:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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 922 [2024-11-11 17:13:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:01,968 INFO L225 Difference]: With dead ends: 30932 [2024-11-11 17:13:01,968 INFO L226 Difference]: Without dead ends: 15796 [2024-11-11 17:13:01,978 INFO L434 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-11 17:13:01,979 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 109 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:01,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 427 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:13:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2024-11-11 17:13:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15467. [2024-11-11 17:13:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0435148066727014) internal successors, (16139), 15466 states have internal predecessors, (16139), 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-11 17:13:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 16139 transitions. [2024-11-11 17:13:02,132 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 16139 transitions. Word has length 922 [2024-11-11 17:13:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:02,134 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 16139 transitions. [2024-11-11 17:13:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-11 17:13:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 16139 transitions. [2024-11-11 17:13:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-11-11 17:13:02,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:02,147 INFO L218 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:13:02,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 17:13:02,148 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1121139085, now seen corresponding path program 1 times [2024-11-11 17:13:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315947258] [2024-11-11 17:13:02,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 1047 proven. 258 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-11 17:13:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315947258] [2024-11-11 17:13:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315947258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:13:03,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725661516] [2024-11-11 17:13:03,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:03,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:13:03,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:13:03,546 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-11 17:13:03,548 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-11 17:13:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:03,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:13:03,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:13:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2024-11-11 17:13:03,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:13:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725661516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:13:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-11 17:13:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114825898] [2024-11-11 17:13:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:03,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:03,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:13:03,928 INFO L87 Difference]: Start difference. First operand 15467 states and 16139 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-11 17:13:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:04,641 INFO L93 Difference]: Finished difference Result 32248 states and 33628 transitions. [2024-11-11 17:13:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 955 [2024-11-11 17:13:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:04,656 INFO L225 Difference]: With dead ends: 32248 [2024-11-11 17:13:04,656 INFO L226 Difference]: Without dead ends: 15467 [2024-11-11 17:13:04,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:13:04,668 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 269 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:04,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 430 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:13:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2024-11-11 17:13:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15467. [2024-11-11 17:13:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0293547135652399) internal successors, (15920), 15466 states have internal predecessors, (15920), 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-11 17:13:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15920 transitions. [2024-11-11 17:13:04,803 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15920 transitions. Word has length 955 [2024-11-11 17:13:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:04,804 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15920 transitions. [2024-11-11 17:13:04,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-11 17:13:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15920 transitions. [2024-11-11 17:13:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1207 [2024-11-11 17:13:04,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:04,823 INFO L218 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, 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, 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, 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, 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, 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, 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-11 17:13:04,840 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-11 17:13:05,023 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,SelfDestructingSolverStorable15 [2024-11-11 17:13:05,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:05,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1551524520, now seen corresponding path program 1 times [2024-11-11 17:13:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527429456] [2024-11-11 17:13:05,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3109 backedges. 2119 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2024-11-11 17:13:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:05,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527429456] [2024-11-11 17:13:05,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527429456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:05,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096976851] [2024-11-11 17:13:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:05,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:05,547 INFO L87 Difference]: Start difference. First operand 15467 states and 15920 transitions. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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-11 17:13:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:06,345 INFO L93 Difference]: Finished difference Result 30274 states and 31174 transitions. [2024-11-11 17:13:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:06,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 1206 [2024-11-11 17:13:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:06,363 INFO L225 Difference]: With dead ends: 30274 [2024-11-11 17:13:06,363 INFO L226 Difference]: Without dead ends: 15467 [2024-11-11 17:13:06,374 INFO L434 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-11 17:13:06,375 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:06,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:13:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2024-11-11 17:13:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 14809. [2024-11-11 17:13:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0243787142085359) internal successors, (15169), 14808 states have internal predecessors, (15169), 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-11 17:13:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15169 transitions. [2024-11-11 17:13:06,493 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15169 transitions. Word has length 1206 [2024-11-11 17:13:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:06,493 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15169 transitions. [2024-11-11 17:13:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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-11 17:13:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15169 transitions. [2024-11-11 17:13:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2024-11-11 17:13:06,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:06,509 INFO L218 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, 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, 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, 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, 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, 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, 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-11 17:13:06,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 17:13:06,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:06,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash 748345937, now seen corresponding path program 1 times [2024-11-11 17:13:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40915420] [2024-11-11 17:13:06,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-11-11 17:13:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40915420] [2024-11-11 17:13:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40915420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:07,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598602110] [2024-11-11 17:13:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:07,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:07,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:07,150 INFO L87 Difference]: Start difference. First operand 14809 states and 15169 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-11 17:13:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:07,877 INFO L93 Difference]: Finished difference Result 32248 states and 33093 transitions. [2024-11-11 17:13:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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 1207 [2024-11-11 17:13:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:07,890 INFO L225 Difference]: With dead ends: 32248 [2024-11-11 17:13:07,890 INFO L226 Difference]: Without dead ends: 15796 [2024-11-11 17:13:07,898 INFO L434 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-11 17:13:07,899 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 274 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:07,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 411 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:13:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2024-11-11 17:13:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 13822. [2024-11-11 17:13:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0228637580493452) internal successors, (14137), 13821 states have internal predecessors, (14137), 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-11 17:13:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14137 transitions. [2024-11-11 17:13:07,997 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14137 transitions. Word has length 1207 [2024-11-11 17:13:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:07,998 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14137 transitions. [2024-11-11 17:13:07,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-11 17:13:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14137 transitions. [2024-11-11 17:13:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1336 [2024-11-11 17:13:08,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:08,013 INFO L218 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:13:08,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 17:13:08,014 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:08,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -260878054, now seen corresponding path program 1 times [2024-11-11 17:13:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501165218] [2024-11-11 17:13:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3455 backedges. 655 proven. 1424 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2024-11-11 17:13:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501165218] [2024-11-11 17:13:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501165218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:13:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295581638] [2024-11-11 17:13:09,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:13:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:13:09,401 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-11 17:13:09,402 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-11 17:13:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:09,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:13:09,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:13:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3455 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 2780 trivial. 0 not checked. [2024-11-11 17:13:09,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:13:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295581638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:09,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:13:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 17:13:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51573829] [2024-11-11 17:13:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:09,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:09,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:13:09,873 INFO L87 Difference]: Start difference. First operand 13822 states and 14137 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-11 17:13:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:10,526 INFO L93 Difference]: Finished difference Result 26982 states and 27607 transitions. [2024-11-11 17:13:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 1335 [2024-11-11 17:13:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:10,528 INFO L225 Difference]: With dead ends: 26982 [2024-11-11 17:13:10,528 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:13:10,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1340 GetRequests, 1336 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:13:10,536 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 290 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:10,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 49 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:13:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:13:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:13:10,537 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-11 17:13:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:13:10,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1335 [2024-11-11 17:13:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:10,537 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:13:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-11 17:13:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:13:10,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:13:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:13:10,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 17:13:10,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:13:10,743 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:10,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:13:11,562 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:13:11,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:13:11 BoogieIcfgContainer [2024-11-11 17:13:11,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:13:11,586 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:13:11,586 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:13:11,586 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:13:11,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:12:33" (3/4) ... [2024-11-11 17:13:11,588 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:13:11,615 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 17:13:11,617 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:13:11,619 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:13:11,620 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:13:11,816 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:13:11,816 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:13:11,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:13:11,817 INFO L158 Benchmark]: Toolchain (without parser) took 41919.34ms. Allocated memory was 157.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.8MB in the beginning and 666.8MB in the end (delta: -585.0MB). Peak memory consumption was 785.7MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,818 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:13:11,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.35ms. Allocated memory is still 157.3MB. Free memory was 81.5MB in the beginning and 74.2MB in the end (delta: 7.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.30ms. Allocated memory is still 157.3MB. Free memory was 74.2MB in the beginning and 50.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,819 INFO L158 Benchmark]: Boogie Preprocessor took 360.54ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 50.0MB in the beginning and 168.9MB in the end (delta: -118.9MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,819 INFO L158 Benchmark]: RCFGBuilder took 2111.28ms. Allocated memory is still 249.6MB. Free memory was 168.9MB in the beginning and 107.8MB in the end (delta: 61.0MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,819 INFO L158 Benchmark]: TraceAbstraction took 38160.23ms. Allocated memory was 249.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.8MB in the beginning and 693.0MB in the end (delta: -585.2MB). Peak memory consumption was 692.0MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,820 INFO L158 Benchmark]: Witness Printer took 231.16ms. Allocated memory is still 1.5GB. Free memory was 693.0MB in the beginning and 666.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-11 17:13:11,821 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.67ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.35ms. Allocated memory is still 157.3MB. Free memory was 81.5MB in the beginning and 74.2MB in the end (delta: 7.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.30ms. Allocated memory is still 157.3MB. Free memory was 74.2MB in the beginning and 50.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 360.54ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 50.0MB in the beginning and 168.9MB in the end (delta: -118.9MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2111.28ms. Allocated memory is still 249.6MB. Free memory was 168.9MB in the beginning and 107.8MB in the end (delta: 61.0MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38160.23ms. Allocated memory was 249.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.8MB in the beginning and 693.0MB in the end (delta: -585.2MB). Peak memory consumption was 692.0MB. Max. memory is 16.1GB. * Witness Printer took 231.16ms. Allocated memory is still 1.5GB. Free memory was 693.0MB in the beginning and 666.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 110]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.2s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5650 SdHoareTripleChecker+Valid, 18.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5650 mSDsluCounter, 4389 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 2902 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18617 IncrementalHoareTripleChecker+Invalid, 21519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2902 mSolverCounterUnsat, 4251 mSDtfsCounter, 18617 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3198 GetRequests, 3158 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15796occurred in iteration=13, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 5593 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 14531 NumberOfCodeBlocks, 14531 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 14509 ConstructedInterpolants, 0 QuantifiedInterpolants, 40242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3694 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 23587/25527 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: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a16 == 9) && (7 == a12)) || ((a16 <= 8) && (a12 <= 6))) || (((a12 == 9) && (a15 <= 3)) && (a16 == 12))) || (((a16 == 9) && (a12 <= 6)) && (4 <= a15))) || ((a12 == 9) && (a16 == 9))) || ((a16 <= 8) && (a12 == 9))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((((a15 <= 3) && (a12 == 8)) && (10 <= a16)) && (a16 <= 11))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || ((a16 == 9) && (a12 == 8))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || (((a16 == 9) && (5 == a12)) && (a15 == 3))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a16 == 12)) && (a12 <= 6))) || (((a16 == 12) && (5 == a12)) && (a15 == 3))) || (((a16 <= 8) && (0 <= ((long long) 87 + a18))) && (a15 <= 3))) || (((a16 <= 8) && (a12 == 8)) && (4 <= a15))) || ((a16 <= 8) && (7 == a12))) || (((10 <= a16) && (a12 <= 6)) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:13:11,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE