./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/Problem13_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:37:32,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:37:32,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:37:32,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:37:32,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:37:32,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:37:32,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:37:32,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:37:32,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:37:32,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:37:32,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:37:32,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:37:32,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:37:32,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:37:32,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:37:32,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:37:32,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:37:32,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:37:32,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:37:32,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:37:32,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:37:32,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:37:32,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:37:32,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:37:32,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:37:32,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:37:32,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:37:32,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:37:32,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:37:32,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:37:32,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:37:32,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:37:32,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:37:32,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:37:32,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:37:32,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:37:32,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:37:32,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:37:32,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:37:32,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:37:32,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:37:32,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:37:32,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055 [2024-10-13 23:37:33,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:37:33,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:37:33,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:37:33,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:37:33,235 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:37:33,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c [2024-10-13 23:37:34,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:37:35,141 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:37:35,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c [2024-10-13 23:37:35,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b9b36d2/9eb5556defcc46d0bac650c7b77cda7a/FLAG8320e5864 [2024-10-13 23:37:35,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b9b36d2/9eb5556defcc46d0bac650c7b77cda7a [2024-10-13 23:37:35,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:37:35,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:37:35,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:37:35,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:37:35,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:37:35,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:37:35" (1/1) ... [2024-10-13 23:37:35,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cfc98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:35, skipping insertion in model container [2024-10-13 23:37:35,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:37:35" (1/1) ... [2024-10-13 23:37:35,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:37:35,602 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/Problem13_label22.c[4777,4790] [2024-10-13 23:37:36,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:37:36,485 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:37:36,510 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/Problem13_label22.c[4777,4790] [2024-10-13 23:37:37,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:37:37,030 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:37:37,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37 WrapperNode [2024-10-13 23:37:37,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:37:37,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:37:37,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:37:37,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:37:37,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:37,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:37,656 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:37:37,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:37:37,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:37:37,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:37:37,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:37:37,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:37,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:37,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,083 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-13 23:37:38,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:37:38,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:37:38,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:37:38,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:37:38,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (1/1) ... [2024-10-13 23:37:38,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:37:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:37:38,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:37:38,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:37:38,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:37:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:37:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:37:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:37:38,893 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:37:38,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:37:44,229 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:37:44,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:37:44,301 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:37:44,301 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:37:44,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:37:44 BoogieIcfgContainer [2024-10-13 23:37:44,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:37:44,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:37:44,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:37:44,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:37:44,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:37:35" (1/3) ... [2024-10-13 23:37:44,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd8cdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:37:44, skipping insertion in model container [2024-10-13 23:37:44,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:37" (2/3) ... [2024-10-13 23:37:44,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd8cdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:37:44, skipping insertion in model container [2024-10-13 23:37:44,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:37:44" (3/3) ... [2024-10-13 23:37:44,310 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label22.c [2024-10-13 23:37:44,326 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:37:44,326 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:37:44,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:37:44,419 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;@5c5fe60e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:37:44,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:37:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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-13 23:37:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 23:37:44,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:37:44,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:37:44,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:37:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:37:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 830551, now seen corresponding path program 1 times [2024-10-13 23:37:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:37:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640717939] [2024-10-13 23:37:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:37:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:37:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:37:44,600 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-13 23:37:44,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:37:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640717939] [2024-10-13 23:37:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640717939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:37:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:37:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:37:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141190608] [2024-10-13 23:37:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:37:44,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:37:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:37:44,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:37:44,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:37:44,634 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:37:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:37:44,754 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-13 23:37:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:37:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 23:37:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:37:44,782 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 23:37:44,782 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 23:37:44,791 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-13 23:37:44,795 INFO L432 NwaCegarLoop]: 1876 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, 1876 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-13 23:37:44,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:37:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 23:37:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 23:37:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 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-13 23:37:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-13 23:37:44,889 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 31 [2024-10-13 23:37:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:37:44,889 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-13 23:37:44,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:37:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-13 23:37:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 23:37:44,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:37:44,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:37:44,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:37:44,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:37:44,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:37:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1073963365, now seen corresponding path program 1 times [2024-10-13 23:37:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:37:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110359372] [2024-10-13 23:37:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:37:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:37:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:37:45,048 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-13 23:37:45,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:37:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110359372] [2024-10-13 23:37:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110359372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:37:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:37:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:37:45,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134037638] [2024-10-13 23:37:45,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:37:45,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:37:45,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:37:45,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:37:45,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:37:45,055 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:37:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:37:49,131 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-13 23:37:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:37:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 23:37:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:37:49,143 INFO L225 Difference]: With dead ends: 2976 [2024-10-13 23:37:49,143 INFO L226 Difference]: Without dead ends: 1943 [2024-10-13 23:37:49,146 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-13 23:37:49,148 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 923 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:37:49,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 23:37:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-13 23:37:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-13 23:37:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 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-13 23:37:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-13 23:37:49,202 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 31 [2024-10-13 23:37:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:37:49,203 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-13 23:37:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:37:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-13 23:37:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 23:37:49,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:37:49,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:37:49,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:37:49,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:37:49,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:37:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 627211793, now seen corresponding path program 1 times [2024-10-13 23:37:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:37:49,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287924168] [2024-10-13 23:37:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:37:49,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:37:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:37:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:37:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:37:49,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287924168] [2024-10-13 23:37:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287924168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:37:49,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:37:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:37:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734345716] [2024-10-13 23:37:49,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:37:49,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:37:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:37:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:37:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:37:49,548 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:37:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:37:53,461 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-13 23:37:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:37:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-13 23:37:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:37:53,475 INFO L225 Difference]: With dead ends: 5350 [2024-10-13 23:37:53,476 INFO L226 Difference]: Without dead ends: 3479 [2024-10-13 23:37:53,479 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-13 23:37:53,480 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:37:53,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 23:37:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-13 23:37:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-13 23:37:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 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-13 23:37:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-13 23:37:53,550 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 96 [2024-10-13 23:37:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:37:53,550 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-13 23:37:53,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:37:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-13 23:37:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 23:37:53,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:37:53,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:37:53,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:37:53,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:37:53,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:37:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1026445620, now seen corresponding path program 1 times [2024-10-13 23:37:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:37:53,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528157405] [2024-10-13 23:37:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:37:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:37:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:37:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:37:53,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:37:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528157405] [2024-10-13 23:37:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528157405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:37:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:37:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:37:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287686737] [2024-10-13 23:37:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:37:53,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:37:53,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:37:53,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:37:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:37:53,702 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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-13 23:37:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:37:56,934 INFO L93 Difference]: Finished difference Result 10141 states and 15437 transitions. [2024-10-13 23:37:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:37:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-13 23:37:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:37:56,955 INFO L225 Difference]: With dead ends: 10141 [2024-10-13 23:37:56,955 INFO L226 Difference]: Without dead ends: 6664 [2024-10-13 23:37:56,960 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-13 23:37:56,961 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:37:56,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 875 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:37:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2024-10-13 23:37:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6656. [2024-10-13 23:37:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 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-13 23:37:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-13 23:37:57,066 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 98 [2024-10-13 23:37:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:37:57,068 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-13 23:37:57,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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-13 23:37:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-13 23:37:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 23:37:57,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:37:57,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:37:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:37:57,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:37:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:37:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1799997635, now seen corresponding path program 1 times [2024-10-13 23:37:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:37:57,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341669533] [2024-10-13 23:37:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:37:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:37:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:37:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:37:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:37:57,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341669533] [2024-10-13 23:37:57,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341669533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:37:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:37:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:37:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390074326] [2024-10-13 23:37:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:37:57,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:37:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:37:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:37:57,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:37:57,261 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:00,320 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-13 23:38:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-13 23:38:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:00,362 INFO L225 Difference]: With dead ends: 19636 [2024-10-13 23:38:00,362 INFO L226 Difference]: Without dead ends: 12981 [2024-10-13 23:38:00,374 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-13 23:38:00,375 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 792 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:00,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1160 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-13 23:38:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12963. [2024-10-13 23:38:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12963 states, 12962 states have (on average 1.2390834747724118) internal successors, (16061), 12962 states have internal predecessors, (16061), 0 states have call successors, (0), 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-13 23:38:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 16061 transitions. [2024-10-13 23:38:00,772 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 16061 transitions. Word has length 104 [2024-10-13 23:38:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:00,773 INFO L471 AbstractCegarLoop]: Abstraction has 12963 states and 16061 transitions. [2024-10-13 23:38:00,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 16061 transitions. [2024-10-13 23:38:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 23:38:00,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:00,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:38:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:38:00,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 715474261, now seen corresponding path program 1 times [2024-10-13 23:38:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970953209] [2024-10-13 23:38:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:00,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970953209] [2024-10-13 23:38:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970953209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:00,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138240371] [2024-10-13 23:38:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:00,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:00,959 INFO L87 Difference]: Start difference. First operand 12963 states and 16061 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:04,424 INFO L93 Difference]: Finished difference Result 32234 states and 40791 transitions. [2024-10-13 23:38:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-10-13 23:38:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:04,468 INFO L225 Difference]: With dead ends: 32234 [2024-10-13 23:38:04,468 INFO L226 Difference]: Without dead ends: 19272 [2024-10-13 23:38:04,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:04,486 INFO L432 NwaCegarLoop]: 1588 mSDtfsCounter, 965 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:04,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1685 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:38:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19272 states. [2024-10-13 23:38:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19272 to 19262. [2024-10-13 23:38:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19262 states, 19261 states have (on average 1.2407974663828463) internal successors, (23899), 19261 states have internal predecessors, (23899), 0 states have call successors, (0), 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-13 23:38:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19262 states to 19262 states and 23899 transitions. [2024-10-13 23:38:04,756 INFO L78 Accepts]: Start accepts. Automaton has 19262 states and 23899 transitions. Word has length 120 [2024-10-13 23:38:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:04,757 INFO L471 AbstractCegarLoop]: Abstraction has 19262 states and 23899 transitions. [2024-10-13 23:38:04,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 19262 states and 23899 transitions. [2024-10-13 23:38:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 23:38:04,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:04,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:38:04,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:38:04,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash -794636132, now seen corresponding path program 1 times [2024-10-13 23:38:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:04,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461947397] [2024-10-13 23:38:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:04,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461947397] [2024-10-13 23:38:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461947397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:04,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:04,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162702158] [2024-10-13 23:38:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:04,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:04,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:04,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:04,896 INFO L87 Difference]: Start difference. First operand 19262 states and 23899 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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-13 23:38:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:07,698 INFO L93 Difference]: Finished difference Result 38541 states and 47830 transitions. [2024-10-13 23:38:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:07,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-10-13 23:38:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:07,735 INFO L225 Difference]: With dead ends: 38541 [2024-10-13 23:38:07,735 INFO L226 Difference]: Without dead ends: 19280 [2024-10-13 23:38:07,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:07,756 INFO L432 NwaCegarLoop]: 1304 mSDtfsCounter, 1092 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:07,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1356 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:38:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2024-10-13 23:38:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 19262. [2024-10-13 23:38:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19262 states, 19261 states have (on average 1.2252738694771819) internal successors, (23600), 19261 states have internal predecessors, (23600), 0 states have call successors, (0), 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-13 23:38:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19262 states to 19262 states and 23600 transitions. [2024-10-13 23:38:07,994 INFO L78 Accepts]: Start accepts. Automaton has 19262 states and 23600 transitions. Word has length 127 [2024-10-13 23:38:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 19262 states and 23600 transitions. [2024-10-13 23:38:07,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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-13 23:38:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19262 states and 23600 transitions. [2024-10-13 23:38:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-13 23:38:07,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:08,000 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:38:08,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:38:08,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:08,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 779868864, now seen corresponding path program 1 times [2024-10-13 23:38:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193600438] [2024-10-13 23:38:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 23:38:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193600438] [2024-10-13 23:38:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193600438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:08,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905909717] [2024-10-13 23:38:08,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:08,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:08,368 INFO L87 Difference]: Start difference. First operand 19262 states and 23600 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-13 23:38:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:10,899 INFO L93 Difference]: Finished difference Result 39310 states and 48001 transitions. [2024-10-13 23:38:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:10,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 202 [2024-10-13 23:38:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:10,927 INFO L225 Difference]: With dead ends: 39310 [2024-10-13 23:38:10,927 INFO L226 Difference]: Without dead ends: 20049 [2024-10-13 23:38:10,944 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-13 23:38:10,946 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:10,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1204 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:38:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20049 states. [2024-10-13 23:38:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20049 to 20049. [2024-10-13 23:38:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20049 states, 20048 states have (on average 1.216679968076616) internal successors, (24392), 20048 states have internal predecessors, (24392), 0 states have call successors, (0), 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-13 23:38:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20049 states to 20049 states and 24392 transitions. [2024-10-13 23:38:11,176 INFO L78 Accepts]: Start accepts. Automaton has 20049 states and 24392 transitions. Word has length 202 [2024-10-13 23:38:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 20049 states and 24392 transitions. [2024-10-13 23:38:11,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-13 23:38:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20049 states and 24392 transitions. [2024-10-13 23:38:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 23:38:11,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:11,179 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:38:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:38:11,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:11,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2043546183, now seen corresponding path program 1 times [2024-10-13 23:38:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:11,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608754798] [2024-10-13 23:38:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:11,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:11,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608754798] [2024-10-13 23:38:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608754798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893884400] [2024-10-13 23:38:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:11,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:11,336 INFO L87 Difference]: Start difference. First operand 20049 states and 24392 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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-13 23:38:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:14,234 INFO L93 Difference]: Finished difference Result 39320 states and 48008 transitions. [2024-10-13 23:38:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2024-10-13 23:38:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:14,258 INFO L225 Difference]: With dead ends: 39320 [2024-10-13 23:38:14,258 INFO L226 Difference]: Without dead ends: 20059 [2024-10-13 23:38:14,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:14,268 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 886 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:14,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 926 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:38:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20059 states. [2024-10-13 23:38:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20059 to 20049. [2024-10-13 23:38:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20049 states, 20048 states have (on average 1.1535814046288906) internal successors, (23127), 20048 states have internal predecessors, (23127), 0 states have call successors, (0), 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-13 23:38:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20049 states to 20049 states and 23127 transitions. [2024-10-13 23:38:14,461 INFO L78 Accepts]: Start accepts. Automaton has 20049 states and 23127 transitions. Word has length 209 [2024-10-13 23:38:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:14,461 INFO L471 AbstractCegarLoop]: Abstraction has 20049 states and 23127 transitions. [2024-10-13 23:38:14,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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-13 23:38:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20049 states and 23127 transitions. [2024-10-13 23:38:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-13 23:38:14,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:14,465 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:14,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:38:14,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2130829855, now seen corresponding path program 1 times [2024-10-13 23:38:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424099214] [2024-10-13 23:38:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-13 23:38:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424099214] [2024-10-13 23:38:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424099214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484310887] [2024-10-13 23:38:14,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:14,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:14,679 INFO L87 Difference]: Start difference. First operand 20049 states and 23127 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-13 23:38:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:18,086 INFO L93 Difference]: Finished difference Result 45629 states and 53336 transitions. [2024-10-13 23:38:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 298 [2024-10-13 23:38:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:18,113 INFO L225 Difference]: With dead ends: 45629 [2024-10-13 23:38:18,113 INFO L226 Difference]: Without dead ends: 26368 [2024-10-13 23:38:18,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:18,123 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 967 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:18,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 784 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26368 states. [2024-10-13 23:38:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26368 to 26356. [2024-10-13 23:38:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26356 states, 26355 states have (on average 1.1452096376399166) internal successors, (30182), 26355 states have internal predecessors, (30182), 0 states have call successors, (0), 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-13 23:38:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26356 states to 26356 states and 30182 transitions. [2024-10-13 23:38:18,492 INFO L78 Accepts]: Start accepts. Automaton has 26356 states and 30182 transitions. Word has length 298 [2024-10-13 23:38:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:18,493 INFO L471 AbstractCegarLoop]: Abstraction has 26356 states and 30182 transitions. [2024-10-13 23:38:18,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-13 23:38:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 26356 states and 30182 transitions. [2024-10-13 23:38:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-13 23:38:18,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:18,505 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:18,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:38:18,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:18,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash 862809219, now seen corresponding path program 1 times [2024-10-13 23:38:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:18,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395880258] [2024-10-13 23:38:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-13 23:38:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395880258] [2024-10-13 23:38:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395880258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:18,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659292456] [2024-10-13 23:38:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:18,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:18,950 INFO L87 Difference]: Start difference. First operand 26356 states and 30182 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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-13 23:38:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:22,065 INFO L93 Difference]: Finished difference Result 61386 states and 70043 transitions. [2024-10-13 23:38:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:22,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2024-10-13 23:38:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:22,101 INFO L225 Difference]: With dead ends: 61386 [2024-10-13 23:38:22,102 INFO L226 Difference]: Without dead ends: 35818 [2024-10-13 23:38:22,123 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-13 23:38:22,124 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 726 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:22,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1221 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35818 states. [2024-10-13 23:38:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35818 to 35810. [2024-10-13 23:38:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35810 states, 35809 states have (on average 1.1199419140439555) internal successors, (40104), 35809 states have internal predecessors, (40104), 0 states have call successors, (0), 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-13 23:38:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35810 states to 35810 states and 40104 transitions. [2024-10-13 23:38:22,573 INFO L78 Accepts]: Start accepts. Automaton has 35810 states and 40104 transitions. Word has length 350 [2024-10-13 23:38:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:22,574 INFO L471 AbstractCegarLoop]: Abstraction has 35810 states and 40104 transitions. [2024-10-13 23:38:22,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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-13 23:38:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35810 states and 40104 transitions. [2024-10-13 23:38:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-13 23:38:22,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:22,580 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-13 23:38:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:38:22,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:22,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash 268816446, now seen corresponding path program 1 times [2024-10-13 23:38:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556054457] [2024-10-13 23:38:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 119 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 23:38:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:23,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556054457] [2024-10-13 23:38:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556054457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:38:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515020482] [2024-10-13 23:38:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:23,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:38:23,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:23,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:38:23,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:38:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:23,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:38:23,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:38:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-10-13 23:38:23,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:38:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515020482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:38:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:38:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543065789] [2024-10-13 23:38:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:38:23,768 INFO L87 Difference]: Start difference. First operand 35810 states and 40104 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-13 23:38:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:26,982 INFO L93 Difference]: Finished difference Result 101689 states and 114342 transitions. [2024-10-13 23:38:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 358 [2024-10-13 23:38:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:27,053 INFO L225 Difference]: With dead ends: 101689 [2024-10-13 23:38:27,054 INFO L226 Difference]: Without dead ends: 66667 [2024-10-13 23:38:27,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:38:27,080 INFO L432 NwaCegarLoop]: 931 mSDtfsCounter, 1045 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2718 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:27,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1139 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2718 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66667 states. [2024-10-13 23:38:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66667 to 66646. [2024-10-13 23:38:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66646 states, 66645 states have (on average 1.1020481656538375) internal successors, (73446), 66645 states have internal predecessors, (73446), 0 states have call successors, (0), 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-13 23:38:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66646 states to 66646 states and 73446 transitions. [2024-10-13 23:38:27,617 INFO L78 Accepts]: Start accepts. Automaton has 66646 states and 73446 transitions. Word has length 358 [2024-10-13 23:38:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:27,617 INFO L471 AbstractCegarLoop]: Abstraction has 66646 states and 73446 transitions. [2024-10-13 23:38:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-13 23:38:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 66646 states and 73446 transitions. [2024-10-13 23:38:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-13 23:38:27,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:27,624 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:27,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:38:27,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 23:38:27,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1716648351, now seen corresponding path program 1 times [2024-10-13 23:38:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434564504] [2024-10-13 23:38:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:38:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434564504] [2024-10-13 23:38:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434564504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:28,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471706281] [2024-10-13 23:38:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:28,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:28,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:28,340 INFO L87 Difference]: Start difference. First operand 66646 states and 73446 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-13 23:38:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:31,587 INFO L93 Difference]: Finished difference Result 128405 states and 141787 transitions. [2024-10-13 23:38:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:31,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 358 [2024-10-13 23:38:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:31,648 INFO L225 Difference]: With dead ends: 128405 [2024-10-13 23:38:31,649 INFO L226 Difference]: Without dead ends: 61760 [2024-10-13 23:38:31,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:31,678 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 1085 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:31,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1625 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61760 states. [2024-10-13 23:38:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61760 to 56241. [2024-10-13 23:38:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56241 states, 56240 states have (on average 1.0810633001422476) internal successors, (60799), 56240 states have internal predecessors, (60799), 0 states have call successors, (0), 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-13 23:38:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56241 states to 56241 states and 60799 transitions. [2024-10-13 23:38:32,410 INFO L78 Accepts]: Start accepts. Automaton has 56241 states and 60799 transitions. Word has length 358 [2024-10-13 23:38:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:32,410 INFO L471 AbstractCegarLoop]: Abstraction has 56241 states and 60799 transitions. [2024-10-13 23:38:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-13 23:38:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 56241 states and 60799 transitions. [2024-10-13 23:38:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-13 23:38:32,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:32,417 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:32,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:38:32,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1234208885, now seen corresponding path program 1 times [2024-10-13 23:38:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43885089] [2024-10-13 23:38:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 272 proven. 113 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 23:38:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43885089] [2024-10-13 23:38:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43885089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:38:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54101203] [2024-10-13 23:38:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:34,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:38:34,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:34,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:38:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:38:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:34,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:38:34,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:38:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 23:38:34,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:38:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54101203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:34,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:38:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-13 23:38:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898001890] [2024-10-13 23:38:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:34,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:34,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:34,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:38:34,527 INFO L87 Difference]: Start difference. First operand 56241 states and 60799 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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-13 23:38:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:37,635 INFO L93 Difference]: Finished difference Result 111675 states and 121614 transitions. [2024-10-13 23:38:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 379 [2024-10-13 23:38:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:37,700 INFO L225 Difference]: With dead ends: 111675 [2024-10-13 23:38:37,700 INFO L226 Difference]: Without dead ends: 66461 [2024-10-13 23:38:37,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:38:37,720 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1216 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 3238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:37,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 402 Invalid, 3238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:38:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66461 states. [2024-10-13 23:38:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66461 to 66461. [2024-10-13 23:38:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66461 states, 66460 states have (on average 1.079190490520614) internal successors, (71723), 66460 states have internal predecessors, (71723), 0 states have call successors, (0), 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-13 23:38:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66461 states to 66461 states and 71723 transitions. [2024-10-13 23:38:38,358 INFO L78 Accepts]: Start accepts. Automaton has 66461 states and 71723 transitions. Word has length 379 [2024-10-13 23:38:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:38,359 INFO L471 AbstractCegarLoop]: Abstraction has 66461 states and 71723 transitions. [2024-10-13 23:38:38,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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-13 23:38:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66461 states and 71723 transitions. [2024-10-13 23:38:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-13 23:38:38,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:38,365 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:38,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:38:38,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:38:38,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:38,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2081825481, now seen corresponding path program 1 times [2024-10-13 23:38:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:38,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610494002] [2024-10-13 23:38:38,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:38,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:38:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610494002] [2024-10-13 23:38:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610494002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:38,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822345817] [2024-10-13 23:38:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:38,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:38,810 INFO L87 Difference]: Start difference. First operand 66461 states and 71723 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-13 23:38:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:43,479 INFO L93 Difference]: Finished difference Result 144730 states and 156791 transitions. [2024-10-13 23:38:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:43,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 388 [2024-10-13 23:38:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:43,564 INFO L225 Difference]: With dead ends: 144730 [2024-10-13 23:38:43,565 INFO L226 Difference]: Without dead ends: 79057 [2024-10-13 23:38:43,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:43,601 INFO L432 NwaCegarLoop]: 1748 mSDtfsCounter, 788 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:43,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1887 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 23:38:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79057 states. [2024-10-13 23:38:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79057 to 78264. [2024-10-13 23:38:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78264 states, 78263 states have (on average 1.0746968554744898) internal successors, (84109), 78263 states have internal predecessors, (84109), 0 states have call successors, (0), 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-13 23:38:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78264 states to 78264 states and 84109 transitions. [2024-10-13 23:38:44,514 INFO L78 Accepts]: Start accepts. Automaton has 78264 states and 84109 transitions. Word has length 388 [2024-10-13 23:38:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:44,515 INFO L471 AbstractCegarLoop]: Abstraction has 78264 states and 84109 transitions. [2024-10-13 23:38:44,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-13 23:38:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 78264 states and 84109 transitions. [2024-10-13 23:38:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-13 23:38:44,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:44,522 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-10-13 23:38:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:38:44,522 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:44,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1788519055, now seen corresponding path program 1 times [2024-10-13 23:38:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173662830] [2024-10-13 23:38:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:44,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-13 23:38:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173662830] [2024-10-13 23:38:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173662830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531492208] [2024-10-13 23:38:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:38:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:38:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:38:44,935 INFO L87 Difference]: Start difference. First operand 78264 states and 84109 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)