./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label46.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 1c2312716e6fa6f39794093b35b73580b35ed138a1f875dde4c4286d98110cb3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:28:15,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:28:16,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:28:16,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:28:16,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:28:16,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:28:16,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:28:16,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:28:16,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:28:16,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:28:16,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:28:16,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:28:16,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:28:16,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:28:16,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:28:16,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:28:16,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:28:16,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:28:16,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:28:16,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:28:16,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:28:16,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:28:16,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:28:16,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:28:16,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:28:16,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:28:16,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:28:16,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:28:16,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:28:16,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:28:16,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:28:16,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:28:16,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:28:16,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:28:16,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:28:16,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:28:16,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:28:16,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:28:16,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:28:16,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:28:16,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:28:16,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:28:16,065 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 -> 1c2312716e6fa6f39794093b35b73580b35ed138a1f875dde4c4286d98110cb3 [2024-11-18 10:28:16,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:28:16,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:28:16,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:28:16,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:28:16,333 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:28:16,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label46.c [2024-11-18 10:28:17,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:28:18,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:28:18,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c [2024-11-18 10:28:18,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c503911e8/be96d31f565f423eb9030739e8f7718a/FLAGf66b25922 [2024-11-18 10:28:18,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c503911e8/be96d31f565f423eb9030739e8f7718a [2024-11-18 10:28:18,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:28:18,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:28:18,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:28:18,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:28:18,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:28:18,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:28:18" (1/1) ... [2024-11-18 10:28:18,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9c210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:18, skipping insertion in model container [2024-11-18 10:28:18,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:28:18" (1/1) ... [2024-11-18 10:28:18,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:28:18,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c[7526,7539] [2024-11-18 10:28:19,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:28:19,569 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:28:19,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c[7526,7539] [2024-11-18 10:28:19,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:28:20,007 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:28:20,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20 WrapperNode [2024-11-18 10:28:20,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:28:20,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:28:20,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:28:20,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:28:20,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,379 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-18 10:28:20,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:28:20,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:28:20,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:28:20,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:28:20,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 10:28:20,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:20,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:21,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:28:21,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:28:21,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:28:21,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:28:21,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (1/1) ... [2024-11-18 10:28:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:28:21,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:28:21,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 10:28:21,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 10:28:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:28:21,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:28:21,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:28:21,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:28:21,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:28:21,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:28:25,555 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-18 10:28:25,556 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:28:25,598 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:28:25,599 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:28:25,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:25 BoogieIcfgContainer [2024-11-18 10:28:25,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:28:25,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:28:25,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:28:25,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:28:25,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:28:18" (1/3) ... [2024-11-18 10:28:25,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68297a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:28:25, skipping insertion in model container [2024-11-18 10:28:25,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:20" (2/3) ... [2024-11-18 10:28:25,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68297a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:28:25, skipping insertion in model container [2024-11-18 10:28:25,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:25" (3/3) ... [2024-11-18 10:28:25,610 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label46.c [2024-11-18 10:28:25,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:28:25,626 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:28:25,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:28:25,721 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;@3735d57e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:28:25,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:28:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-18 10:28:25,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:25,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:28:25,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2024-11-18 10:28:25,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:25,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261337045] [2024-11-18 10:28:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:25,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:28:26,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:26,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261337045] [2024-11-18 10:28:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261337045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:26,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:26,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:26,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916321275] [2024-11-18 10:28:26,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:28:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:28:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:28:26,417 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:32,526 INFO L93 Difference]: Finished difference Result 3143 states and 6131 transitions. [2024-11-18 10:28:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:28:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-18 10:28:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:32,560 INFO L225 Difference]: With dead ends: 3143 [2024-11-18 10:28:32,560 INFO L226 Difference]: Without dead ends: 2257 [2024-11-18 10:28:32,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:28:32,570 INFO L432 NwaCegarLoop]: 755 mSDtfsCounter, 2207 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5311 mSolverCounterSat, 1364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 6675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1364 IncrementalHoareTripleChecker+Valid, 5311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:32,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 782 Invalid, 6675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1364 Valid, 5311 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-18 10:28:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-18 10:28:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-18 10:28:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.513741134751773) internal successors, (3415), 2256 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3415 transitions. [2024-11-18 10:28:32,693 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3415 transitions. Word has length 61 [2024-11-18 10:28:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:32,694 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3415 transitions. [2024-11-18 10:28:32,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3415 transitions. [2024-11-18 10:28:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-18 10:28:32,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:32,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:28:32,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:28:32,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:32,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:32,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1473698629, now seen corresponding path program 1 times [2024-11-18 10:28:32,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:32,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639860570] [2024-11-18 10:28:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:32,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:28:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639860570] [2024-11-18 10:28:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639860570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086524980] [2024-11-18 10:28:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:33,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:28:33,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:33,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:28:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:28:33,102 INFO L87 Difference]: Start difference. First operand 2257 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:36,929 INFO L93 Difference]: Finished difference Result 6051 states and 9520 transitions. [2024-11-18 10:28:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:28:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-18 10:28:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:36,944 INFO L225 Difference]: With dead ends: 6051 [2024-11-18 10:28:36,944 INFO L226 Difference]: Without dead ends: 3759 [2024-11-18 10:28:36,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:28:36,948 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:36,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 711 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-18 10:28:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2024-11-18 10:28:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2024-11-18 10:28:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3304949441192124) internal successors, (5000), 3758 states have internal predecessors, (5000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5000 transitions. [2024-11-18 10:28:37,042 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5000 transitions. Word has length 132 [2024-11-18 10:28:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:37,042 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5000 transitions. [2024-11-18 10:28:37,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5000 transitions. [2024-11-18 10:28:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-18 10:28:37,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:37,060 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:28:37,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:28:37,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:37,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -123333798, now seen corresponding path program 1 times [2024-11-18 10:28:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963797926] [2024-11-18 10:28:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:37,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-18 10:28:37,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963797926] [2024-11-18 10:28:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963797926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:37,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:37,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:37,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600417701] [2024-11-18 10:28:37,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:37,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:28:37,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:37,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:28:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:28:37,547 INFO L87 Difference]: Start difference. First operand 3759 states and 5000 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:40,566 INFO L93 Difference]: Finished difference Result 9057 states and 12624 transitions. [2024-11-18 10:28:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:28:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 273 [2024-11-18 10:28:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:40,586 INFO L225 Difference]: With dead ends: 9057 [2024-11-18 10:28:40,586 INFO L226 Difference]: Without dead ends: 5263 [2024-11-18 10:28:40,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:28:40,593 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:40,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 324 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-18 10:28:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2024-11-18 10:28:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5261. [2024-11-18 10:28:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.3241444866920151) internal successors, (6965), 5260 states have internal predecessors, (6965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6965 transitions. [2024-11-18 10:28:40,701 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6965 transitions. Word has length 273 [2024-11-18 10:28:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:40,703 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 6965 transitions. [2024-11-18 10:28:40,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6965 transitions. [2024-11-18 10:28:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-18 10:28:40,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:40,713 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:28:40,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:28:40,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:40,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash -751477987, now seen corresponding path program 1 times [2024-11-18 10:28:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786428331] [2024-11-18 10:28:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:28:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786428331] [2024-11-18 10:28:40,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786428331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:40,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:40,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030626224] [2024-11-18 10:28:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:40,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:28:40,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:40,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:28:40,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:40,963 INFO L87 Difference]: Start difference. First operand 5261 states and 6965 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:43,723 INFO L93 Difference]: Finished difference Result 15026 states and 20134 transitions. [2024-11-18 10:28:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:28:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2024-11-18 10:28:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:43,752 INFO L225 Difference]: With dead ends: 15026 [2024-11-18 10:28:43,753 INFO L226 Difference]: Without dead ends: 9767 [2024-11-18 10:28:43,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:43,764 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 676 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:43,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1260 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-18 10:28:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-18 10:28:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2024-11-18 10:28:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2976653696498055) internal successors, (12673), 9766 states have internal predecessors, (12673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12673 transitions. [2024-11-18 10:28:43,917 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12673 transitions. Word has length 287 [2024-11-18 10:28:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:43,918 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12673 transitions. [2024-11-18 10:28:43,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12673 transitions. [2024-11-18 10:28:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-18 10:28:43,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:43,924 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:28:43,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:28:43,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:43,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1603998483, now seen corresponding path program 1 times [2024-11-18 10:28:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787271028] [2024-11-18 10:28:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 41 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:28:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:44,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787271028] [2024-11-18 10:28:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787271028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:28:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065335594] [2024-11-18 10:28:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:28:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:28:44,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:28:44,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 10:28:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:44,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:28:44,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:28:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 10:28:44,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:28:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065335594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:44,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:28:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-18 10:28:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755085333] [2024-11-18 10:28:44,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:28:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:44,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:28:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 10:28:44,762 INFO L87 Difference]: Start difference. First operand 9767 states and 12673 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:47,613 INFO L93 Difference]: Finished difference Result 26291 states and 34790 transitions. [2024-11-18 10:28:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:28:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 291 [2024-11-18 10:28:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:47,652 INFO L225 Difference]: With dead ends: 26291 [2024-11-18 10:28:47,653 INFO L226 Difference]: Without dead ends: 16526 [2024-11-18 10:28:47,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 10:28:47,671 INFO L432 NwaCegarLoop]: 1222 mSDtfsCounter, 711 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:47,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1230 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-18 10:28:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2024-11-18 10:28:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 16526. [2024-11-18 10:28:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16526 states, 16525 states have (on average 1.295431164901664) internal successors, (21407), 16525 states have internal predecessors, (21407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 21407 transitions. [2024-11-18 10:28:47,908 INFO L78 Accepts]: Start accepts. Automaton has 16526 states and 21407 transitions. Word has length 291 [2024-11-18 10:28:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:47,908 INFO L471 AbstractCegarLoop]: Abstraction has 16526 states and 21407 transitions. [2024-11-18 10:28:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states and 21407 transitions. [2024-11-18 10:28:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-18 10:28:47,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:47,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:28:47,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 10:28:48,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:28:48,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:48,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1047752527, now seen corresponding path program 1 times [2024-11-18 10:28:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751706685] [2024-11-18 10:28:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-18 10:28:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751706685] [2024-11-18 10:28:48,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751706685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:28:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470611553] [2024-11-18 10:28:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:28:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:28:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:48,345 INFO L87 Difference]: Start difference. First operand 16526 states and 21407 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:51,060 INFO L93 Difference]: Finished difference Result 33050 states and 42812 transitions. [2024-11-18 10:28:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:28:51,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 295 [2024-11-18 10:28:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:51,094 INFO L225 Difference]: With dead ends: 33050 [2024-11-18 10:28:51,094 INFO L226 Difference]: Without dead ends: 16526 [2024-11-18 10:28:51,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:51,111 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 694 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:51,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 431 Invalid, 2672 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [703 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-18 10:28:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2024-11-18 10:28:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 15775. [2024-11-18 10:28:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.1835298592620769) internal successors, (18669), 15774 states have internal predecessors, (18669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 18669 transitions. [2024-11-18 10:28:51,310 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 18669 transitions. Word has length 295 [2024-11-18 10:28:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:51,310 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 18669 transitions. [2024-11-18 10:28:51,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 18669 transitions. [2024-11-18 10:28:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-18 10:28:51,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:51,317 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-18 10:28:51,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:28:51,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:51,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1851741939, now seen corresponding path program 1 times [2024-11-18 10:28:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813881299] [2024-11-18 10:28:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-18 10:28:51,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:51,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813881299] [2024-11-18 10:28:51,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813881299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:51,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:51,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055867611] [2024-11-18 10:28:51,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:51,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:28:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:51,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:28:51,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:51,534 INFO L87 Difference]: Start difference. First operand 15775 states and 18669 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:54,083 INFO L93 Difference]: Finished difference Result 39809 states and 47722 transitions. [2024-11-18 10:28:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:28:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 374 [2024-11-18 10:28:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:54,124 INFO L225 Difference]: With dead ends: 39809 [2024-11-18 10:28:54,124 INFO L226 Difference]: Without dead ends: 24036 [2024-11-18 10:28:54,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:54,142 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 765 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:54,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 235 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-18 10:28:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2024-11-18 10:28:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 24036. [2024-11-18 10:28:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24036 states, 24035 states have (on average 1.1562721031828582) internal successors, (27791), 24035 states have internal predecessors, (27791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24036 states to 24036 states and 27791 transitions. [2024-11-18 10:28:54,391 INFO L78 Accepts]: Start accepts. Automaton has 24036 states and 27791 transitions. Word has length 374 [2024-11-18 10:28:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:54,392 INFO L471 AbstractCegarLoop]: Abstraction has 24036 states and 27791 transitions. [2024-11-18 10:28:54,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24036 states and 27791 transitions. [2024-11-18 10:28:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-18 10:28:54,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:54,399 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2024-11-18 10:28:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:28:54,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 221592895, now seen corresponding path program 1 times [2024-11-18 10:28:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519536405] [2024-11-18 10:28:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 10:28:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:54,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519536405] [2024-11-18 10:28:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519536405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:54,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:54,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683921389] [2024-11-18 10:28:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:54,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:28:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:28:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:54,713 INFO L87 Difference]: Start difference. First operand 24036 states and 27791 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:28:57,053 INFO L93 Difference]: Finished difference Result 54829 states and 63104 transitions. [2024-11-18 10:28:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:28:57,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 389 [2024-11-18 10:28:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:28:57,095 INFO L225 Difference]: With dead ends: 54829 [2024-11-18 10:28:57,095 INFO L226 Difference]: Without dead ends: 27040 [2024-11-18 10:28:57,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:57,121 INFO L432 NwaCegarLoop]: 1366 mSDtfsCounter, 698 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 10:28:57,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1374 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 10:28:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27040 states. [2024-11-18 10:28:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27040 to 27040. [2024-11-18 10:28:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.1385406265024594) internal successors, (30785), 27039 states have internal predecessors, (30785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30785 transitions. [2024-11-18 10:28:57,411 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 30785 transitions. Word has length 389 [2024-11-18 10:28:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:28:57,412 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 30785 transitions. [2024-11-18 10:28:57,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:28:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 30785 transitions. [2024-11-18 10:28:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-18 10:28:57,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:28:57,421 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:28:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:28:57,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:28:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:28:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1749530698, now seen corresponding path program 1 times [2024-11-18 10:28:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:28:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701645030] [2024-11-18 10:28:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:28:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:28:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:28:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-18 10:28:57,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:28:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701645030] [2024-11-18 10:28:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701645030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:28:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:28:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:28:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348269429] [2024-11-18 10:28:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:28:57,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:28:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:28:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:28:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:28:57,742 INFO L87 Difference]: Start difference. First operand 27040 states and 30785 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:29:00,353 INFO L93 Difference]: Finished difference Result 54078 states and 61568 transitions. [2024-11-18 10:29:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:29:00,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 461 [2024-11-18 10:29:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:29:00,399 INFO L225 Difference]: With dead ends: 54078 [2024-11-18 10:29:00,399 INFO L226 Difference]: Without dead ends: 27040 [2024-11-18 10:29:00,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:29:00,424 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 733 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:29:00,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 245 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-18 10:29:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27040 states. [2024-11-18 10:29:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27040 to 26289. [2024-11-18 10:29:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26289 states, 26288 states have (on average 1.130211503347535) internal successors, (29711), 26288 states have internal predecessors, (29711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26289 states to 26289 states and 29711 transitions. [2024-11-18 10:29:00,702 INFO L78 Accepts]: Start accepts. Automaton has 26289 states and 29711 transitions. Word has length 461 [2024-11-18 10:29:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:29:00,704 INFO L471 AbstractCegarLoop]: Abstraction has 26289 states and 29711 transitions. [2024-11-18 10:29:00,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26289 states and 29711 transitions. [2024-11-18 10:29:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-18 10:29:00,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:29:00,714 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:29:00,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 10:29:00,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:29:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:29:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1145440842, now seen corresponding path program 1 times [2024-11-18 10:29:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:29:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39565136] [2024-11-18 10:29:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:29:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:29:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:29:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-18 10:29:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:29:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39565136] [2024-11-18 10:29:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39565136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:29:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:29:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:29:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596986767] [2024-11-18 10:29:01,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:29:01,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:29:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:29:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:29:01,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:29:01,055 INFO L87 Difference]: Start difference. First operand 26289 states and 29711 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:29:03,668 INFO L93 Difference]: Finished difference Result 72102 states and 82127 transitions. [2024-11-18 10:29:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:29:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 472 [2024-11-18 10:29:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:29:03,725 INFO L225 Difference]: With dead ends: 72102 [2024-11-18 10:29:03,726 INFO L226 Difference]: Without dead ends: 45815 [2024-11-18 10:29:03,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:29:03,755 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 700 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:29:03,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 508 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-18 10:29:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45815 states. [2024-11-18 10:29:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45815 to 45064. [2024-11-18 10:29:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45064 states, 45063 states have (on average 1.1200097641080264) internal successors, (50471), 45063 states have internal predecessors, (50471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 50471 transitions. [2024-11-18 10:29:04,353 INFO L78 Accepts]: Start accepts. Automaton has 45064 states and 50471 transitions. Word has length 472 [2024-11-18 10:29:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:29:04,354 INFO L471 AbstractCegarLoop]: Abstraction has 45064 states and 50471 transitions. [2024-11-18 10:29:04,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 45064 states and 50471 transitions. [2024-11-18 10:29:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-11-18 10:29:04,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:29:04,369 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2024-11-18 10:29:04,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:29:04,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:29:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:29:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1461221601, now seen corresponding path program 1 times [2024-11-18 10:29:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:29:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824863954] [2024-11-18 10:29:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:29:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:29:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:29:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 276 proven. 333 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-18 10:29:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:29:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824863954] [2024-11-18 10:29:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824863954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:29:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90465029] [2024-11-18 10:29:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:29:05,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:29:05,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:29:05,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:29:05,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 10:29:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:29:05,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:29:05,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:29:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-18 10:29:05,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:29:05,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90465029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:29:05,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:29:05,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-18 10:29:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635786337] [2024-11-18 10:29:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:29:05,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:29:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:29:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:29:05,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 10:29:05,324 INFO L87 Difference]: Start difference. First operand 45064 states and 50471 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:29:07,967 INFO L93 Difference]: Finished difference Result 105144 states and 118413 transitions. [2024-11-18 10:29:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:29:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 499 [2024-11-18 10:29:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:29:07,968 INFO L225 Difference]: With dead ends: 105144 [2024-11-18 10:29:07,968 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:29:08,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 498 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-11-18 10:29:08,003 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 813 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:29:08,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1114 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-18 10:29:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:29:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:29:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:29:08,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 499 [2024-11-18 10:29:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:29:08,005 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:29:08,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:29:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:29:08,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:29:08,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:29:08,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 10:29:08,209 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,SelfDestructingSolverStorable10 [2024-11-18 10:29:08,212 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:29:08,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:29:09,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:29:09,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:29:09 BoogieIcfgContainer [2024-11-18 10:29:09,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:29:09,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:29:09,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:29:09,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:29:09,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:25" (3/4) ... [2024-11-18 10:29:09,067 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:29:09,116 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-18 10:29:09,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:29:09,128 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:29:09,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:29:09,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:29:09,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:29:09,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:29:09,467 INFO L158 Benchmark]: Toolchain (without parser) took 51080.93ms. Allocated memory was 157.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 73.5MB in the beginning and 859.8MB in the end (delta: -786.3MB). Peak memory consumption was 334.2MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,467 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:29:09,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1622.53ms. Allocated memory is still 157.3MB. Free memory was 73.3MB in the beginning and 82.9MB in the end (delta: -9.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 370.13ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 82.9MB in the beginning and 129.0MB in the end (delta: -46.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,468 INFO L158 Benchmark]: Boogie Preprocessor took 629.85ms. Allocated memory is still 241.2MB. Free memory was 129.0MB in the beginning and 120.1MB in the end (delta: 8.9MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,468 INFO L158 Benchmark]: RCFGBuilder took 4587.60ms. Allocated memory was 241.2MB in the beginning and 482.3MB in the end (delta: 241.2MB). Free memory was 120.1MB in the beginning and 175.9MB in the end (delta: -55.8MB). Peak memory consumption was 256.2MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,469 INFO L158 Benchmark]: TraceAbstraction took 43462.88ms. Allocated memory was 482.3MB in the beginning and 1.3GB in the end (delta: 796.9MB). Free memory was 174.8MB in the beginning and 929.0MB in the end (delta: -754.2MB). Peak memory consumption was 424.4MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,469 INFO L158 Benchmark]: Witness Printer took 401.51ms. Allocated memory is still 1.3GB. Free memory was 929.0MB in the beginning and 859.8MB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-18 10:29:09,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1622.53ms. Allocated memory is still 157.3MB. Free memory was 73.3MB in the beginning and 82.9MB in the end (delta: -9.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 370.13ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 82.9MB in the beginning and 129.0MB in the end (delta: -46.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 629.85ms. Allocated memory is still 241.2MB. Free memory was 129.0MB in the beginning and 120.1MB in the end (delta: 8.9MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. * RCFGBuilder took 4587.60ms. Allocated memory was 241.2MB in the beginning and 482.3MB in the end (delta: 241.2MB). Free memory was 120.1MB in the beginning and 175.9MB in the end (delta: -55.8MB). Peak memory consumption was 256.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43462.88ms. Allocated memory was 482.3MB in the beginning and 1.3GB in the end (delta: 796.9MB). Free memory was 174.8MB in the beginning and 929.0MB in the end (delta: -754.2MB). Peak memory consumption was 424.4MB. Max. memory is 16.1GB. * Witness Printer took 401.51ms. Allocated memory is still 1.3GB. Free memory was 929.0MB in the beginning and 859.8MB 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: 205]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.5s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9535 SdHoareTripleChecker+Valid, 32.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9535 mSDsluCounter, 8214 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 7060 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30218 IncrementalHoareTripleChecker+Invalid, 37278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7060 mSolverCounterUnsat, 8098 mSDtfsCounter, 30218 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45064occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 2255 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4324 NumberOfCodeBlocks, 4324 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4311 ConstructedInterpolants, 0 QuantifiedInterpolants, 14295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1042 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 4437/4930 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: (((((((5 <= a5) || ((14 <= a7) && (a17 <= 111))) || ((a7 <= 13) && (3 == a5))) || ((a2 <= 170) && (a7 <= 13))) || ((a2 <= 170) && (3 == a5))) || (a24 != 13)) || (190 <= a2)) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:29:09,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE