./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a53da247d111b038b398eff5160740a2a02616f3c1ac05da6f779ac954a53edf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:01:19,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:01:20,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:01:20,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:01:20,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:01:20,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:01:20,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:01:20,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:01:20,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:01:20,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:01:20,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:01:20,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:01:20,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:01:20,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:01:20,138 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:01:20,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:01:20,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:01:20,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:01:20,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:01:20,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:01:20,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:01:20,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:01:20,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:01:20,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:01:20,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:01:20,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:01:20,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:01:20,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:01:20,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:01:20,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:01:20,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:01:20,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:01:20,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:01:20,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:01:20,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:01:20,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:01:20,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:01:20,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:01:20,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:01:20,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:01:20,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:01:20,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:01:20,147 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-clean/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-clean/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 -> a53da247d111b038b398eff5160740a2a02616f3c1ac05da6f779ac954a53edf [2024-10-11 00:01:20,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:01:20,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:01:20,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:01:20,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:01:20,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:01:20,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c [2024-10-11 00:01:21,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:01:22,294 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:01:22,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c [2024-10-11 00:01:22,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/245366793/c7d0d7eb619d4b07a69dfe4e566285e0/FLAG9448e8342 [2024-10-11 00:01:22,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/245366793/c7d0d7eb619d4b07a69dfe4e566285e0 [2024-10-11 00:01:22,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:01:22,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:01:22,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:01:22,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:01:22,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:01:22,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:01:22" (1/1) ... [2024-10-11 00:01:22,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747cb9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:22, skipping insertion in model container [2024-10-11 00:01:22,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:01:22" (1/1) ... [2024-10-11 00:01:22,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:01:22,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c[2142,2155] [2024-10-11 00:01:23,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:01:23,753 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:01:23,769 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c[2142,2155] [2024-10-11 00:01:24,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:01:24,372 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:01:24,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24 WrapperNode [2024-10-11 00:01:24,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:01:24,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:01:24,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:01:24,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:01:24,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:24,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:25,202 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-11 00:01:25,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:01:25,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:01:25,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:01:25,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:01:25,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:25,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:25,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:25,741 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:01:25,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:25,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:26,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:26,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:26,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:26,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:26,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:01:26,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:01:26,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:01:26,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:01:26,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (1/1) ... [2024-10-11 00:01:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:01:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:01:26,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:01:26,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:01:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:01:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:01:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:01:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:01:26,539 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:01:26,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:01:34,654 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-11 00:01:34,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:01:34,757 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:01:34,757 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:01:34,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:01:34 BoogieIcfgContainer [2024-10-11 00:01:34,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:01:34,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:01:34,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:01:34,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:01:34,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:01:22" (1/3) ... [2024-10-11 00:01:34,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432bbcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:01:34, skipping insertion in model container [2024-10-11 00:01:34,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:01:24" (2/3) ... [2024-10-11 00:01:34,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432bbcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:01:34, skipping insertion in model container [2024-10-11 00:01:34,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:01:34" (3/3) ... [2024-10-11 00:01:34,770 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label58.c [2024-10-11 00:01:34,788 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:01:34,788 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:01:34,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:01:34,919 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;@4eb8250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:01:34,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:01:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:01:34,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:34,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:01:34,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1454044635, now seen corresponding path program 1 times [2024-10-11 00:01:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156119614] [2024-10-11 00:01:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:34,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156119614] [2024-10-11 00:01:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156119614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:35,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:35,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:01:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118384498] [2024-10-11 00:01:35,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:35,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:01:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:01:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:01:35,184 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:35,305 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-11 00:01:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:01:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-11 00:01:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:35,333 INFO L225 Difference]: With dead ends: 3371 [2024-10-11 00:01:35,334 INFO L226 Difference]: Without dead ends: 1684 [2024-10-11 00:01:35,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:01:35,347 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:35,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:01:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-11 00:01:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-11 00:01:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-11 00:01:35,463 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 12 [2024-10-11 00:01:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-11 00:01:35,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-11 00:01:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:01:35,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:35,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:01:35,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:01:35,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1747517152, now seen corresponding path program 1 times [2024-10-11 00:01:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371789204] [2024-10-11 00:01:35,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:35,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371789204] [2024-10-11 00:01:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371789204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:01:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488348070] [2024-10-11 00:01:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:01:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:01:35,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:01:35,594 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:43,072 INFO L93 Difference]: Finished difference Result 4811 states and 9064 transitions. [2024-10-11 00:01:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:01:43,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-11 00:01:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:43,099 INFO L225 Difference]: With dead ends: 4811 [2024-10-11 00:01:43,099 INFO L226 Difference]: Without dead ends: 3128 [2024-10-11 00:01:43,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:01:43,108 INFO L432 NwaCegarLoop]: 1324 mSDtfsCounter, 1594 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4269 mSolverCounterSat, 1473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1473 IncrementalHoareTripleChecker+Valid, 4269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:43,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1543 Invalid, 5742 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1473 Valid, 4269 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-11 00:01:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2024-10-11 00:01:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3107. [2024-10-11 00:01:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 3106 states have (on average 1.601416613007083) internal successors, (4974), 3106 states have internal predecessors, (4974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 4974 transitions. [2024-10-11 00:01:43,178 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 4974 transitions. Word has length 12 [2024-10-11 00:01:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:43,178 INFO L471 AbstractCegarLoop]: Abstraction has 3107 states and 4974 transitions. [2024-10-11 00:01:43,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 4974 transitions. [2024-10-11 00:01:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 00:01:43,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:43,183 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 00:01:43,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:01:43,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:43,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -539161043, now seen corresponding path program 1 times [2024-10-11 00:01:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579348092] [2024-10-11 00:01:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579348092] [2024-10-11 00:01:43,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579348092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:43,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:43,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:01:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000759494] [2024-10-11 00:01:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:43,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:01:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:43,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:01:43,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:01:43,539 INFO L87 Difference]: Start difference. First operand 3107 states and 4974 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:52,789 INFO L93 Difference]: Finished difference Result 10358 states and 16186 transitions. [2024-10-11 00:01:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:01:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-11 00:01:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:52,816 INFO L225 Difference]: With dead ends: 10358 [2024-10-11 00:01:52,816 INFO L226 Difference]: Without dead ends: 7252 [2024-10-11 00:01:52,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:01:52,824 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 4322 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 9505 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4322 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 11003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:52,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4322 Valid, 1290 Invalid, 11003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9505 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-10-11 00:01:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7252 states. [2024-10-11 00:01:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 7248. [2024-10-11 00:01:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7247 states have (on average 1.4503932661791086) internal successors, (10511), 7247 states have internal predecessors, (10511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 10511 transitions. [2024-10-11 00:01:52,952 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 10511 transitions. Word has length 79 [2024-10-11 00:01:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:52,952 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 10511 transitions. [2024-10-11 00:01:52,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 10511 transitions. [2024-10-11 00:01:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-11 00:01:52,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:52,963 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:01:52,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:01:52,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -580898727, now seen corresponding path program 1 times [2024-10-11 00:01:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090542616] [2024-10-11 00:01:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 00:01:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090542616] [2024-10-11 00:01:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090542616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:01:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241772379] [2024-10-11 00:01:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:53,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:01:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:53,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:01:53,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:01:53,986 INFO L87 Difference]: Start difference. First operand 7248 states and 10511 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:02:01,747 INFO L93 Difference]: Finished difference Result 17268 states and 24866 transitions. [2024-10-11 00:02:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:02:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2024-10-11 00:02:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:02:01,788 INFO L225 Difference]: With dead ends: 17268 [2024-10-11 00:02:01,789 INFO L226 Difference]: Without dead ends: 11386 [2024-10-11 00:02:01,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:02:01,802 INFO L432 NwaCegarLoop]: 1801 mSDtfsCounter, 3755 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 9456 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 9886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:02:01,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2155 Invalid, 9886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9456 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-11 00:02:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11386 states. [2024-10-11 00:02:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11386 to 11366. [2024-10-11 00:02:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11366 states, 11365 states have (on average 1.328640563132424) internal successors, (15100), 11365 states have internal predecessors, (15100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11366 states to 11366 states and 15100 transitions. [2024-10-11 00:02:02,014 INFO L78 Accepts]: Start accepts. Automaton has 11366 states and 15100 transitions. Word has length 286 [2024-10-11 00:02:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:02:02,016 INFO L471 AbstractCegarLoop]: Abstraction has 11366 states and 15100 transitions. [2024-10-11 00:02:02,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11366 states and 15100 transitions. [2024-10-11 00:02:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-10-11 00:02:02,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:02:02,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:02:02,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:02:02,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:02:02,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:02:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 777901107, now seen corresponding path program 1 times [2024-10-11 00:02:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:02:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200390711] [2024-10-11 00:02:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:02:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:02:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:02:02,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200390711] [2024-10-11 00:02:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200390711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:02:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:02:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:02:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86286650] [2024-10-11 00:02:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:02:02,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:02:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:02:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:02:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:02:02,676 INFO L87 Difference]: Start difference. First operand 11366 states and 15100 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:02:08,994 INFO L93 Difference]: Finished difference Result 20032 states and 27482 transitions. [2024-10-11 00:02:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:02:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 314 [2024-10-11 00:02:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:02:09,023 INFO L225 Difference]: With dead ends: 20032 [2024-10-11 00:02:09,023 INFO L226 Difference]: Without dead ends: 11366 [2024-10-11 00:02:09,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:02:09,033 INFO L432 NwaCegarLoop]: 1773 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7326 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 7334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:02:09,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2114 Invalid, 7334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7326 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 00:02:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11366 states. [2024-10-11 00:02:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11366 to 11366. [2024-10-11 00:02:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11366 states, 11365 states have (on average 1.3274967003959526) internal successors, (15087), 11365 states have internal predecessors, (15087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11366 states to 11366 states and 15087 transitions. [2024-10-11 00:02:09,260 INFO L78 Accepts]: Start accepts. Automaton has 11366 states and 15087 transitions. Word has length 314 [2024-10-11 00:02:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:02:09,261 INFO L471 AbstractCegarLoop]: Abstraction has 11366 states and 15087 transitions. [2024-10-11 00:02:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 11366 states and 15087 transitions. [2024-10-11 00:02:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-10-11 00:02:09,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:02:09,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:02:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:02:09,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:02:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:02:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1362989567, now seen corresponding path program 1 times [2024-10-11 00:02:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:02:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565009454] [2024-10-11 00:02:09,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:02:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:02:10,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:02:10,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565009454] [2024-10-11 00:02:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565009454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:02:10,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348207371] [2024-10-11 00:02:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:10,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:02:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:02:10,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:02:10,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 00:02:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:11,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:02:11,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:02:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 00:02:11,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:02:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348207371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:02:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:02:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 00:02:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785580170] [2024-10-11 00:02:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:02:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:02:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:02:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:02:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:02:11,631 INFO L87 Difference]: Start difference. First operand 11366 states and 15087 transitions. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:02:16,452 INFO L93 Difference]: Finished difference Result 24132 states and 33156 transitions. [2024-10-11 00:02:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:02:16,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 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-10-11 00:02:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:02:16,491 INFO L225 Difference]: With dead ends: 24132 [2024-10-11 00:02:16,491 INFO L226 Difference]: Without dead ends: 15497 [2024-10-11 00:02:16,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:02:16,509 INFO L432 NwaCegarLoop]: 1205 mSDtfsCounter, 1058 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4577 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 5386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 4577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 00:02:16,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1382 Invalid, 5386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 4577 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 00:02:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15497 states. [2024-10-11 00:02:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15497 to 15495. [2024-10-11 00:02:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15495 states, 15494 states have (on average 1.2934038982832063) internal successors, (20040), 15494 states have internal predecessors, (20040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 20040 transitions. [2024-10-11 00:02:16,737 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 20040 transitions. Word has length 499 [2024-10-11 00:02:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:02:16,738 INFO L471 AbstractCegarLoop]: Abstraction has 15495 states and 20040 transitions. [2024-10-11 00:02:16,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 20040 transitions. [2024-10-11 00:02:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-10-11 00:02:16,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:02:16,748 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:02:16,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 00:02:16,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:02:16,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:02:16,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:02:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1229019482, now seen corresponding path program 1 times [2024-10-11 00:02:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:02:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61471082] [2024-10-11 00:02:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:02:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 43 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:02:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:02:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61471082] [2024-10-11 00:02:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61471082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:02:17,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652570157] [2024-10-11 00:02:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:17,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:02:17,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:02:17,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:02:17,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 00:02:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:18,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:02:18,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:02:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:02:18,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:02:18,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652570157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:02:18,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:02:18,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 00:02:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146053309] [2024-10-11 00:02:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:02:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:02:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:02:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:02:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:02:18,242 INFO L87 Difference]: Start difference. First operand 15495 states and 20040 transitions. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:02:23,811 INFO L93 Difference]: Finished difference Result 40539 states and 53990 transitions. [2024-10-11 00:02:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:02:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 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 568 [2024-10-11 00:02:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:02:23,861 INFO L225 Difference]: With dead ends: 40539 [2024-10-11 00:02:23,861 INFO L226 Difference]: Without dead ends: 27775 [2024-10-11 00:02:23,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:02:23,881 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 2530 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4054 mSolverCounterSat, 1472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2530 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 5526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1472 IncrementalHoareTripleChecker+Valid, 4054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 00:02:23,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2530 Valid, 812 Invalid, 5526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1472 Valid, 4054 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 00:02:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27775 states. [2024-10-11 00:02:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27775 to 27771. [2024-10-11 00:02:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27771 states, 27770 states have (on average 1.2915376305365502) internal successors, (35866), 27770 states have internal predecessors, (35866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27771 states to 27771 states and 35866 transitions. [2024-10-11 00:02:24,243 INFO L78 Accepts]: Start accepts. Automaton has 27771 states and 35866 transitions. Word has length 568 [2024-10-11 00:02:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:02:24,244 INFO L471 AbstractCegarLoop]: Abstraction has 27771 states and 35866 transitions. [2024-10-11 00:02:24,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27771 states and 35866 transitions. [2024-10-11 00:02:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2024-10-11 00:02:24,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:02:24,255 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:02:24,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 00:02:24,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:02:24,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:02:24,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:02:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1128653485, now seen corresponding path program 1 times [2024-10-11 00:02:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:02:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672544124] [2024-10-11 00:02:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:02:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-11 00:02:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:02:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672544124] [2024-10-11 00:02:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672544124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:02:24,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:02:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:02:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524121592] [2024-10-11 00:02:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:02:24,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:02:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:02:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:02:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:02:24,864 INFO L87 Difference]: Start difference. First operand 27771 states and 35866 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:02:29,899 INFO L93 Difference]: Finished difference Result 58284 states and 75895 transitions. [2024-10-11 00:02:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:02:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 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 573 [2024-10-11 00:02:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:02:29,937 INFO L225 Difference]: With dead ends: 58284 [2024-10-11 00:02:29,937 INFO L226 Difference]: Without dead ends: 33244 [2024-10-11 00:02:29,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:02:29,959 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 1383 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 1660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 5586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1660 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 00:02:29,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 731 Invalid, 5586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1660 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 00:02:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33244 states. [2024-10-11 00:02:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33244 to 33234. [2024-10-11 00:02:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33234 states, 33233 states have (on average 1.2287786236572082) internal successors, (40836), 33233 states have internal predecessors, (40836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33234 states to 33234 states and 40836 transitions. [2024-10-11 00:02:30,265 INFO L78 Accepts]: Start accepts. Automaton has 33234 states and 40836 transitions. Word has length 573 [2024-10-11 00:02:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:02:30,265 INFO L471 AbstractCegarLoop]: Abstraction has 33234 states and 40836 transitions. [2024-10-11 00:02:30,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33234 states and 40836 transitions. [2024-10-11 00:02:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2024-10-11 00:02:30,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:02:30,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:02:30,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 00:02:30,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:02:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:02:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1390654969, now seen corresponding path program 1 times [2024-10-11 00:02:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:02:30,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287922052] [2024-10-11 00:02:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:02:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-11 00:02:30,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:02:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287922052] [2024-10-11 00:02:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287922052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:02:30,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:02:30,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:02:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454618583] [2024-10-11 00:02:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:02:30,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:02:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:02:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:02:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:02:30,595 INFO L87 Difference]: Start difference. First operand 33234 states and 40836 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:02:36,014 INFO L93 Difference]: Finished difference Result 91259 states and 113480 transitions. [2024-10-11 00:02:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:02:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 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 590 [2024-10-11 00:02:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:02:36,102 INFO L225 Difference]: With dead ends: 91259 [2024-10-11 00:02:36,102 INFO L226 Difference]: Without dead ends: 60756 [2024-10-11 00:02:36,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:02:36,136 INFO L432 NwaCegarLoop]: 1745 mSDtfsCounter, 1350 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 5711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:02:36,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2011 Invalid, 5711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 00:02:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60756 states. [2024-10-11 00:02:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60756 to 55275. [2024-10-11 00:02:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55275 states, 55274 states have (on average 1.1672033867641205) internal successors, (64516), 55274 states have internal predecessors, (64516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55275 states to 55275 states and 64516 transitions. [2024-10-11 00:02:36,963 INFO L78 Accepts]: Start accepts. Automaton has 55275 states and 64516 transitions. Word has length 590 [2024-10-11 00:02:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:02:36,964 INFO L471 AbstractCegarLoop]: Abstraction has 55275 states and 64516 transitions. [2024-10-11 00:02:36,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:02:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 55275 states and 64516 transitions. [2024-10-11 00:02:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-10-11 00:02:36,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:02:36,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:02:36,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 00:02:36,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:02:36,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:02:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash -285721741, now seen corresponding path program 1 times [2024-10-11 00:02:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:02:36,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697863445] [2024-10-11 00:02:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:02:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-11 00:02:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:02:38,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697863445] [2024-10-11 00:02:38,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697863445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:02:38,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347151413] [2024-10-11 00:02:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:02:38,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:02:38,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:02:38,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:02:38,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 00:02:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:02:38,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:02:38,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:02:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-11 00:02:38,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:02:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347151413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:02:38,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:02:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 00:02:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484004809] [2024-10-11 00:02:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:02:38,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:02:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:02:38,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:02:38,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:02:38,282 INFO L87 Difference]: Start difference. First operand 55275 states and 64516 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)