./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.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 009b18d49acf284b9866fb4283bf61c04b940d5d5b8f73fcface32bff3af3727 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:08:23,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:08:23,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:08:23,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:08:23,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:08:23,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:08:23,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:08:23,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:08:23,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:08:23,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:08:23,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:08:23,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:08:23,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:08:23,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:08:23,792 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:08:23,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:08:23,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:08:23,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:08:23,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:08:23,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:08:23,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:08:23,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:08:23,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:08:23,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:08:23,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:08:23,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:08:23,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:08:23,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:08:23,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:08:23,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:08:23,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:08:23,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:08:23,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:08:23,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:08:23,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:08:23,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:08:23,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:08:23,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:08:23,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:08:23,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:08:23,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:08:23,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:08:23,808 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 -> 009b18d49acf284b9866fb4283bf61c04b940d5d5b8f73fcface32bff3af3727 [2024-10-23 21:08:23,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:08:23,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:08:23,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:08:23,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:08:23,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:08:23,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c [2024-10-23 21:08:25,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:08:25,583 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:08:25,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c [2024-10-23 21:08:25,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fbb273cb/8fded72904a643edb789a82af553b322/FLAGe78778235 [2024-10-23 21:08:25,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fbb273cb/8fded72904a643edb789a82af553b322 [2024-10-23 21:08:25,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:08:25,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:08:25,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:08:25,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:08:25,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:08:25,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:08:25" (1/1) ... [2024-10-23 21:08:25,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379b44db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:25, skipping insertion in model container [2024-10-23 21:08:25,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:08:25" (1/1) ... [2024-10-23 21:08:25,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:08:26,142 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c[5259,5272] [2024-10-23 21:08:26,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:08:26,691 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:08:26,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c[5259,5272] [2024-10-23 21:08:26,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:08:27,042 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:08:27,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27 WrapperNode [2024-10-23 21:08:27,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:08:27,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:08:27,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:08:27,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:08:27,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,389 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-23 21:08:27,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:08:27,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:08:27,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:08:27,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:08:27,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 21:08:27,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:08:27,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:08:27,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:08:27,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:08:27,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (1/1) ... [2024-10-23 21:08:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:08:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:08:27,911 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-10-23 21:08:27,916 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-10-23 21:08:27,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:08:27,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:08:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:08:27,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:08:28,038 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:08:28,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:08:31,208 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-23 21:08:31,208 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:08:31,252 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:08:31,253 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:08:31,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:08:31 BoogieIcfgContainer [2024-10-23 21:08:31,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:08:31,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:08:31,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:08:31,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:08:31,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:08:25" (1/3) ... [2024-10-23 21:08:31,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21da0011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:08:31, skipping insertion in model container [2024-10-23 21:08:31,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:27" (2/3) ... [2024-10-23 21:08:31,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21da0011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:08:31, skipping insertion in model container [2024-10-23 21:08:31,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:08:31" (3/3) ... [2024-10-23 21:08:31,260 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label43.c [2024-10-23 21:08:31,271 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:08:31,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:08:31,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:08:31,385 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;@6f89c8ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:08:31,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:08:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-23 21:08:31,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:31,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:08:31,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:31,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash -300558176, now seen corresponding path program 1 times [2024-10-23 21:08:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390310836] [2024-10-23 21:08:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:08:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390310836] [2024-10-23 21:08:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390310836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:31,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:31,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:08:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19178805] [2024-10-23 21:08:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:08:31,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:31,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:08:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:08:31,543 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:31,739 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-23 21:08:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:08:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2024-10-23 21:08:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:31,780 INFO L225 Difference]: With dead ends: 1511 [2024-10-23 21:08:31,780 INFO L226 Difference]: Without dead ends: 754 [2024-10-23 21:08:31,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:08:31,795 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:31,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:08:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-23 21:08:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-23 21:08:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-23 21:08:31,918 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 40 [2024-10-23 21:08:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:31,918 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-23 21:08:31,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-23 21:08:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-23 21:08:31,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:31,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:08:31,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:08:31,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1971092058, now seen corresponding path program 1 times [2024-10-23 21:08:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:31,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18699759] [2024-10-23 21:08:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:08:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:32,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18699759] [2024-10-23 21:08:32,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18699759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:32,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:32,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:08:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702460452] [2024-10-23 21:08:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:32,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:08:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:08:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:32,196 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:35,423 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-23 21:08:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:08:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2024-10-23 21:08:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:35,433 INFO L225 Difference]: With dead ends: 2258 [2024-10-23 21:08:35,435 INFO L226 Difference]: Without dead ends: 1505 [2024-10-23 21:08:35,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:35,436 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 777 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:35,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-23 21:08:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-23 21:08:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-23 21:08:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-23 21:08:35,468 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 40 [2024-10-23 21:08:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:35,468 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-23 21:08:35,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-23 21:08:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-23 21:08:35,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:35,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:08:35,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:08:35,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:35,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1652776042, now seen corresponding path program 1 times [2024-10-23 21:08:35,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:35,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236184881] [2024-10-23 21:08:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:35,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:08:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236184881] [2024-10-23 21:08:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236184881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:35,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:35,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:08:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268383979] [2024-10-23 21:08:35,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:08:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:08:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:08:35,692 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:38,932 INFO L93 Difference]: Finished difference Result 4548 states and 7429 transitions. [2024-10-23 21:08:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:08:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2024-10-23 21:08:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:38,952 INFO L225 Difference]: With dead ends: 4548 [2024-10-23 21:08:38,952 INFO L226 Difference]: Without dead ends: 3007 [2024-10-23 21:08:38,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:08:38,962 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:38,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 649 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-23 21:08:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-23 21:08:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-23 21:08:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.3416500332667998) internal successors, (4033), 3006 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4033 transitions. [2024-10-23 21:08:39,062 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4033 transitions. Word has length 111 [2024-10-23 21:08:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:39,062 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4033 transitions. [2024-10-23 21:08:39,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4033 transitions. [2024-10-23 21:08:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-23 21:08:39,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:39,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:08:39,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:08:39,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash 310010473, now seen corresponding path program 1 times [2024-10-23 21:08:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590959850] [2024-10-23 21:08:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:08:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590959850] [2024-10-23 21:08:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590959850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:39,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:39,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:08:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109702346] [2024-10-23 21:08:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:39,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:08:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:08:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:08:39,453 INFO L87 Difference]: Start difference. First operand 3007 states and 4033 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:43,499 INFO L93 Difference]: Finished difference Result 9768 states and 12891 transitions. [2024-10-23 21:08:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:08:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2024-10-23 21:08:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:43,518 INFO L225 Difference]: With dead ends: 9768 [2024-10-23 21:08:43,519 INFO L226 Difference]: Without dead ends: 6762 [2024-10-23 21:08:43,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:08:43,524 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 2093 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:43,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 449 Invalid, 4842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4275 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-23 21:08:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-23 21:08:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-23 21:08:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.2875314302617955) internal successors, (8705), 6761 states have internal predecessors, (8705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 8705 transitions. [2024-10-23 21:08:43,642 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 8705 transitions. Word has length 149 [2024-10-23 21:08:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:43,644 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 8705 transitions. [2024-10-23 21:08:43,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 8705 transitions. [2024-10-23 21:08:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-23 21:08:43,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:43,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:08:43,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:08:43,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:43,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1989260587, now seen corresponding path program 1 times [2024-10-23 21:08:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:43,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545949869] [2024-10-23 21:08:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-23 21:08:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545949869] [2024-10-23 21:08:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545949869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:08:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254007084] [2024-10-23 21:08:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:44,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:08:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:08:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:08:44,081 INFO L87 Difference]: Start difference. First operand 6762 states and 8705 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:47,304 INFO L93 Difference]: Finished difference Result 15815 states and 21395 transitions. [2024-10-23 21:08:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:08:47,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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 252 [2024-10-23 21:08:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:47,325 INFO L225 Difference]: With dead ends: 15815 [2024-10-23 21:08:47,326 INFO L226 Difference]: Without dead ends: 9768 [2024-10-23 21:08:47,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:08:47,333 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:47,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 491 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-23 21:08:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9768 states. [2024-10-23 21:08:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766. [2024-10-23 21:08:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.273220686123912) internal successors, (12433), 9765 states have internal predecessors, (12433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12433 transitions. [2024-10-23 21:08:47,471 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12433 transitions. Word has length 252 [2024-10-23 21:08:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:47,472 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12433 transitions. [2024-10-23 21:08:47,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12433 transitions. [2024-10-23 21:08:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-23 21:08:47,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:47,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:08:47,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:08:47,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:47,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1169675509, now seen corresponding path program 1 times [2024-10-23 21:08:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:47,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200330326] [2024-10-23 21:08:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-23 21:08:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:47,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200330326] [2024-10-23 21:08:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200330326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:47,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:08:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278086092] [2024-10-23 21:08:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:08:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:47,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:08:47,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:47,655 INFO L87 Difference]: Start difference. First operand 9766 states and 12433 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:50,337 INFO L93 Difference]: Finished difference Result 26290 states and 34156 transitions. [2024-10-23 21:08:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:08:50,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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 255 [2024-10-23 21:08:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:50,373 INFO L225 Difference]: With dead ends: 26290 [2024-10-23 21:08:50,373 INFO L226 Difference]: Without dead ends: 17276 [2024-10-23 21:08:50,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:50,386 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 619 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:50,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 596 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:08:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2024-10-23 21:08:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 16525. [2024-10-23 21:08:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.2063664972161705) internal successors, (19934), 16524 states have internal predecessors, (19934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 19934 transitions. [2024-10-23 21:08:50,587 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 19934 transitions. Word has length 255 [2024-10-23 21:08:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:50,588 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 19934 transitions. [2024-10-23 21:08:50,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 19934 transitions. [2024-10-23 21:08:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-23 21:08:50,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:50,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:08:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:08:50,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1386239268, now seen corresponding path program 1 times [2024-10-23 21:08:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448162032] [2024-10-23 21:08:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:50,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-23 21:08:50,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:50,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448162032] [2024-10-23 21:08:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448162032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:50,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:08:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753862261] [2024-10-23 21:08:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:50,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:08:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:08:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:50,813 INFO L87 Difference]: Start difference. First operand 16525 states and 19934 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:53,494 INFO L93 Difference]: Finished difference Result 32298 states and 39111 transitions. [2024-10-23 21:08:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:08:53,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 270 [2024-10-23 21:08:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:53,519 INFO L225 Difference]: With dead ends: 32298 [2024-10-23 21:08:53,519 INFO L226 Difference]: Without dead ends: 16525 [2024-10-23 21:08:53,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:53,535 INFO L432 NwaCegarLoop]: 1231 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:53,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1238 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:08:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16525 states. [2024-10-23 21:08:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16525 to 15774. [2024-10-23 21:08:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.1770747479870665) internal successors, (18566), 15773 states have internal predecessors, (18566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 18566 transitions. [2024-10-23 21:08:53,684 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 18566 transitions. Word has length 270 [2024-10-23 21:08:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:53,685 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 18566 transitions. [2024-10-23 21:08:53,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 18566 transitions. [2024-10-23 21:08:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-23 21:08:53,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:53,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-23 21:08:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:08:53,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:53,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1023949987, now seen corresponding path program 1 times [2024-10-23 21:08:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:53,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558789049] [2024-10-23 21:08:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-23 21:08:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:53,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558789049] [2024-10-23 21:08:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558789049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:08:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774035866] [2024-10-23 21:08:53,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:08:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:08:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:53,795 INFO L87 Difference]: Start difference. First operand 15774 states and 18566 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:56,542 INFO L93 Difference]: Finished difference Result 42061 states and 50216 transitions. [2024-10-23 21:08:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:08:56,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 271 [2024-10-23 21:08:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:56,662 INFO L225 Difference]: With dead ends: 42061 [2024-10-23 21:08:56,662 INFO L226 Difference]: Without dead ends: 27039 [2024-10-23 21:08:56,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:56,669 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 743 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:56,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 438 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:08:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27039 states. [2024-10-23 21:08:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27039 to 26288. [2024-10-23 21:08:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26288 states, 26287 states have (on average 1.1635028721421234) internal successors, (30585), 26287 states have internal predecessors, (30585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26288 states to 26288 states and 30585 transitions. [2024-10-23 21:08:56,855 INFO L78 Accepts]: Start accepts. Automaton has 26288 states and 30585 transitions. Word has length 271 [2024-10-23 21:08:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:08:56,857 INFO L471 AbstractCegarLoop]: Abstraction has 26288 states and 30585 transitions. [2024-10-23 21:08:56,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 26288 states and 30585 transitions. [2024-10-23 21:08:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-23 21:08:56,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:08:56,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:08:56,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:08:56,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:08:56,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:08:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -987113612, now seen corresponding path program 1 times [2024-10-23 21:08:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:08:56,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794921531] [2024-10-23 21:08:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:08:56,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:08:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:08:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-23 21:08:57,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:08:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794921531] [2024-10-23 21:08:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794921531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:08:57,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:08:57,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:08:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653138177] [2024-10-23 21:08:57,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:08:57,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:08:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:08:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:08:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:57,005 INFO L87 Difference]: Start difference. First operand 26288 states and 30585 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:08:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:08:59,730 INFO L93 Difference]: Finished difference Result 65342 states and 77205 transitions. [2024-10-23 21:08:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:08:59,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 302 [2024-10-23 21:08:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:08:59,772 INFO L225 Difference]: With dead ends: 65342 [2024-10-23 21:08:59,773 INFO L226 Difference]: Without dead ends: 39806 [2024-10-23 21:08:59,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:08:59,797 INFO L432 NwaCegarLoop]: 1341 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:08:59,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1348 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-23 21:08:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39806 states. [2024-10-23 21:09:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 39806. [2024-10-23 21:09:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 39805 states have (on average 1.1431478457480215) internal successors, (45503), 39805 states have internal predecessors, (45503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 45503 transitions. [2024-10-23 21:09:00,343 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 45503 transitions. Word has length 302 [2024-10-23 21:09:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:00,344 INFO L471 AbstractCegarLoop]: Abstraction has 39806 states and 45503 transitions. [2024-10-23 21:09:00,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 45503 transitions. [2024-10-23 21:09:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-23 21:09:00,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:00,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:09:00,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash -578567536, now seen corresponding path program 1 times [2024-10-23 21:09:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233944323] [2024-10-23 21:09:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-23 21:09:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:00,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233944323] [2024-10-23 21:09:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233944323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765121047] [2024-10-23 21:09:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:00,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:00,556 INFO L87 Difference]: Start difference. First operand 39806 states and 45503 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:03,586 INFO L93 Difference]: Finished difference Result 99888 states and 114531 transitions. [2024-10-23 21:09:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 317 [2024-10-23 21:09:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:03,659 INFO L225 Difference]: With dead ends: 99888 [2024-10-23 21:09:03,659 INFO L226 Difference]: Without dead ends: 60834 [2024-10-23 21:09:03,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:03,688 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 760 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 787 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 787 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:03,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 169 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [787 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-23 21:09:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60834 states. [2024-10-23 21:09:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60834 to 50320. [2024-10-23 21:09:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50320 states, 50319 states have (on average 1.1593831355949045) internal successors, (58339), 50319 states have internal predecessors, (58339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50320 states to 50320 states and 58339 transitions. [2024-10-23 21:09:04,465 INFO L78 Accepts]: Start accepts. Automaton has 50320 states and 58339 transitions. Word has length 317 [2024-10-23 21:09:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:04,466 INFO L471 AbstractCegarLoop]: Abstraction has 50320 states and 58339 transitions. [2024-10-23 21:09:04,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 50320 states and 58339 transitions. [2024-10-23 21:09:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-23 21:09:04,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:04,470 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:04,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:09:04,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:04,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -702782343, now seen corresponding path program 1 times [2024-10-23 21:09:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473653676] [2024-10-23 21:09:04,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-23 21:09:04,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:04,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473653676] [2024-10-23 21:09:04,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473653676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:04,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:04,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004584120] [2024-10-23 21:09:04,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:04,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:04,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:04,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:04,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:04,885 INFO L87 Difference]: Start difference. First operand 50320 states and 58339 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:07,635 INFO L93 Difference]: Finished difference Result 99888 states and 115921 transitions. [2024-10-23 21:09:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 362 [2024-10-23 21:09:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:07,693 INFO L225 Difference]: With dead ends: 99888 [2024-10-23 21:09:07,694 INFO L226 Difference]: Without dead ends: 50320 [2024-10-23 21:09:07,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:07,713 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 682 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:07,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1210 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-23 21:09:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50320 states. [2024-10-23 21:09:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50320 to 48067. [2024-10-23 21:09:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48067 states, 48066 states have (on average 1.0916864311571588) internal successors, (52473), 48066 states have internal predecessors, (52473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48067 states to 48067 states and 52473 transitions. [2024-10-23 21:09:08,272 INFO L78 Accepts]: Start accepts. Automaton has 48067 states and 52473 transitions. Word has length 362 [2024-10-23 21:09:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 48067 states and 52473 transitions. [2024-10-23 21:09:08,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 48067 states and 52473 transitions. [2024-10-23 21:09:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-23 21:09:08,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:08,291 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:09:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:09:08,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -271427982, now seen corresponding path program 1 times [2024-10-23 21:09:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391867106] [2024-10-23 21:09:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 196 proven. 333 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-23 21:09:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391867106] [2024-10-23 21:09:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391867106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:09:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051011860] [2024-10-23 21:09:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:09:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:09:09,032 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-10-23 21:09:09,035 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-10-23 21:09:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:09,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:09:09,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:09:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-23 21:09:09,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:09:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051011860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:09:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 21:09:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271335342] [2024-10-23 21:09:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:09,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:09:09,304 INFO L87 Difference]: Start difference. First operand 48067 states and 52473 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:11,667 INFO L93 Difference]: Finished difference Result 110402 states and 121351 transitions. [2024-10-23 21:09:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:11,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 478 [2024-10-23 21:09:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:11,738 INFO L225 Difference]: With dead ends: 110402 [2024-10-23 21:09:11,738 INFO L226 Difference]: Without dead ends: 63087 [2024-10-23 21:09:11,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:09:11,780 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 833 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:11,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1114 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-23 21:09:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63087 states. [2024-10-23 21:09:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63087 to 63087. [2024-10-23 21:09:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63087 states, 63086 states have (on average 1.0840123006689282) internal successors, (68386), 63086 states have internal predecessors, (68386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63087 states to 63087 states and 68386 transitions. [2024-10-23 21:09:12,503 INFO L78 Accepts]: Start accepts. Automaton has 63087 states and 68386 transitions. Word has length 478 [2024-10-23 21:09:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 63087 states and 68386 transitions. [2024-10-23 21:09:12,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63087 states and 68386 transitions. [2024-10-23 21:09:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-10-23 21:09:12,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:12,534 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:12,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:09:12,735 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,SelfDestructingSolverStorable11 [2024-10-23 21:09:12,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:12,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash -843876329, now seen corresponding path program 1 times [2024-10-23 21:09:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603611700] [2024-10-23 21:09:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-23 21:09:13,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603611700] [2024-10-23 21:09:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603611700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:13,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:13,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218996093] [2024-10-23 21:09:13,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:13,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:13,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:13,182 INFO L87 Difference]: Start difference. First operand 63087 states and 68386 transitions. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:15,932 INFO L93 Difference]: Finished difference Result 153960 states and 167878 transitions. [2024-10-23 21:09:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:15,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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 582 [2024-10-23 21:09:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:16,017 INFO L225 Difference]: With dead ends: 153960 [2024-10-23 21:09:16,017 INFO L226 Difference]: Without dead ends: 87119 [2024-10-23 21:09:16,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:16,053 INFO L432 NwaCegarLoop]: 1296 mSDtfsCounter, 580 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:16,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1303 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-23 21:09:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87119 states. [2024-10-23 21:09:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87119 to 81111. [2024-10-23 21:09:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81111 states, 81110 states have (on average 1.0749969177659968) internal successors, (87193), 81110 states have internal predecessors, (87193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81111 states to 81111 states and 87193 transitions. [2024-10-23 21:09:16,960 INFO L78 Accepts]: Start accepts. Automaton has 81111 states and 87193 transitions. Word has length 582 [2024-10-23 21:09:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:16,960 INFO L471 AbstractCegarLoop]: Abstraction has 81111 states and 87193 transitions. [2024-10-23 21:09:16,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 81111 states and 87193 transitions. [2024-10-23 21:09:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2024-10-23 21:09:16,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:16,976 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:16,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:09:16,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:16,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:16,977 INFO L85 PathProgramCache]: Analyzing trace with hash 896904451, now seen corresponding path program 1 times [2024-10-23 21:09:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815680330] [2024-10-23 21:09:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-23 21:09:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815680330] [2024-10-23 21:09:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815680330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483576408] [2024-10-23 21:09:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:17,398 INFO L87 Difference]: Start difference. First operand 81111 states and 87193 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:20,507 INFO L93 Difference]: Finished difference Result 190759 states and 205894 transitions. [2024-10-23 21:09:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:20,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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 664 [2024-10-23 21:09:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:20,627 INFO L225 Difference]: With dead ends: 190759 [2024-10-23 21:09:20,627 INFO L226 Difference]: Without dead ends: 110400 [2024-10-23 21:09:20,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:20,672 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 662 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:20,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1280 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:09:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110400 states. [2024-10-23 21:09:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110400 to 103641. [2024-10-23 21:09:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103641 states, 103640 states have (on average 1.0670011578541103) internal successors, (110584), 103640 states have internal predecessors, (110584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103641 states to 103641 states and 110584 transitions. [2024-10-23 21:09:21,871 INFO L78 Accepts]: Start accepts. Automaton has 103641 states and 110584 transitions. Word has length 664 [2024-10-23 21:09:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:21,871 INFO L471 AbstractCegarLoop]: Abstraction has 103641 states and 110584 transitions. [2024-10-23 21:09:21,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 103641 states and 110584 transitions. [2024-10-23 21:09:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2024-10-23 21:09:21,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:21,888 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:21,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:09:21,889 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash -661266109, now seen corresponding path program 1 times [2024-10-23 21:09:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86171677] [2024-10-23 21:09:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-23 21:09:22,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86171677] [2024-10-23 21:09:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86171677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:22,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474147212] [2024-10-23 21:09:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:22,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:22,445 INFO L87 Difference]: Start difference. First operand 103641 states and 110584 transitions. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:25,289 INFO L93 Difference]: Finished difference Result 229060 states and 244893 transitions. [2024-10-23 21:09:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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 664 [2024-10-23 21:09:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:25,438 INFO L225 Difference]: With dead ends: 229060 [2024-10-23 21:09:25,438 INFO L226 Difference]: Without dead ends: 126171 [2024-10-23 21:09:25,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:25,494 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 769 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:25,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 121 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-23 21:09:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126171 states. [2024-10-23 21:09:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126171 to 126171. [2024-10-23 21:09:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126171 states, 126170 states have (on average 1.0632321471031148) internal successors, (134148), 126170 states have internal predecessors, (134148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126171 states to 126171 states and 134148 transitions. [2024-10-23 21:09:26,929 INFO L78 Accepts]: Start accepts. Automaton has 126171 states and 134148 transitions. Word has length 664 [2024-10-23 21:09:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 126171 states and 134148 transitions. [2024-10-23 21:09:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 126171 states and 134148 transitions. [2024-10-23 21:09:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2024-10-23 21:09:26,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:26,949 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:09:26,949 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1063351578, now seen corresponding path program 1 times [2024-10-23 21:09:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605737421] [2024-10-23 21:09:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 708 proven. 110 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-23 21:09:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:27,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605737421] [2024-10-23 21:09:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605737421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:09:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491716971] [2024-10-23 21:09:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:27,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:09:27,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:09:27,993 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-10-23 21:09:27,993 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-10-23 21:09:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:28,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:09:28,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:09:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2024-10-23 21:09:28,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:09:28,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491716971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:28,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:09:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 21:09:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384710211] [2024-10-23 21:09:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:28,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:09:28,406 INFO L87 Difference]: Start difference. First operand 126171 states and 134148 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:31,028 INFO L93 Difference]: Finished difference Result 271114 states and 288494 transitions. [2024-10-23 21:09:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 750 [2024-10-23 21:09:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:31,030 INFO L225 Difference]: With dead ends: 271114 [2024-10-23 21:09:31,030 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:09:31,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:09:31,056 INFO L432 NwaCegarLoop]: 1328 mSDtfsCounter, 740 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:31,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1334 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-23 21:09:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:09:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:09:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:09:31,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 750 [2024-10-23 21:09:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:31,061 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:09:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:09:31,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:09:31,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:09:31,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 21:09:31,268 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-10-23 21:09:31,272 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:09:31,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:09:35,828 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:09:35,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:09:35 BoogieIcfgContainer [2024-10-23 21:09:35,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:09:35,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:09:35,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:09:35,841 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:09:35,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:08:31" (3/4) ... [2024-10-23 21:09:35,843 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:09:35,875 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-23 21:09:35,879 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:09:35,883 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:09:35,886 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:09:36,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:09:36,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:09:36,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:09:36,123 INFO L158 Benchmark]: Toolchain (without parser) took 70286.63ms. Allocated memory was 165.7MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 83.6MB in the beginning and 9.3GB in the end (delta: -9.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-10-23 21:09:36,123 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:09:36,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1201.73ms. Allocated memory was 165.7MB in the beginning and 251.7MB in the end (delta: 86.0MB). Free memory was 83.4MB in the beginning and 189.8MB in the end (delta: -106.4MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. [2024-10-23 21:09:36,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 348.39ms. Allocated memory is still 251.7MB. Free memory was 189.8MB in the beginning and 119.5MB in the end (delta: 70.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-10-23 21:09:36,124 INFO L158 Benchmark]: Boogie Preprocessor took 432.19ms. Allocated memory is still 251.7MB. Free memory was 119.5MB in the beginning and 82.8MB in the end (delta: 36.7MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-10-23 21:09:36,124 INFO L158 Benchmark]: RCFGBuilder took 3427.74ms. Allocated memory was 251.7MB in the beginning and 503.3MB in the end (delta: 251.7MB). Free memory was 82.8MB in the beginning and 197.7MB in the end (delta: -114.9MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2024-10-23 21:09:36,125 INFO L158 Benchmark]: TraceAbstraction took 64585.94ms. Allocated memory was 503.3MB in the beginning and 11.4GB in the end (delta: 10.9GB). Free memory was 196.7MB in the beginning and 9.4GB in the end (delta: -9.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-10-23 21:09:36,125 INFO L158 Benchmark]: Witness Printer took 280.87ms. Allocated memory is still 11.4GB. Free memory was 9.4GB in the beginning and 9.3GB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-23 21:09:36,128 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.13ms. Allocated memory is still 165.7MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1201.73ms. Allocated memory was 165.7MB in the beginning and 251.7MB in the end (delta: 86.0MB). Free memory was 83.4MB in the beginning and 189.8MB in the end (delta: -106.4MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 348.39ms. Allocated memory is still 251.7MB. Free memory was 189.8MB in the beginning and 119.5MB in the end (delta: 70.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 432.19ms. Allocated memory is still 251.7MB. Free memory was 119.5MB in the beginning and 82.8MB in the end (delta: 36.7MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * RCFGBuilder took 3427.74ms. Allocated memory was 251.7MB in the beginning and 503.3MB in the end (delta: 251.7MB). Free memory was 82.8MB in the beginning and 197.7MB in the end (delta: -114.9MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * TraceAbstraction took 64585.94ms. Allocated memory was 503.3MB in the beginning and 11.4GB in the end (delta: 10.9GB). Free memory was 196.7MB in the beginning and 9.4GB in the end (delta: -9.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 280.87ms. Allocated memory is still 11.4GB. Free memory was 9.4GB in the beginning and 9.3GB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. 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: 145]: 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, 756 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.0s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 45.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12233 SdHoareTripleChecker+Valid, 40.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12233 mSDsluCounter, 13604 SdHoareTripleChecker+Invalid, 33.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 8859 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37421 IncrementalHoareTripleChecker+Invalid, 46280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8859 mSolverCounterUnsat, 13482 mSDtfsCounter, 37421 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1274 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126171occurred in iteration=15, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 27789 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 6735 NumberOfCodeBlocks, 6735 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6717 ConstructedInterpolants, 0 QuantifiedInterpolants, 17574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 6763/7206 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: 4828]: Loop Invariant Derived loop invariant: ((((((((((((((a24 == 14) && (a17 <= 111)) || ((a2 <= 170) && (a24 == 14))) || (6 <= a5)) || ((a17 <= 111) && (a7 != 12))) || ((a2 <= 170) && (a7 <= 13))) || ((a5 <= 3) && (a7 == 12))) || ((a7 <= 13) && (15 <= a24))) || ((a2 <= 170) && (256 <= a17))) || ((a2 <= 170) && (a5 <= 3))) || (5 == a5)) || ((a2 <= 170) && (15 <= a24))) || (190 <= a2)) || ((256 <= a17) && (15 <= a24))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:09:36,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE