./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_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label54.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49ff6ba228d081d26cec6b087caf15954318cb178107abc089cabcbe5599946d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:31:18,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:31:18,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:31:18,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:31:18,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:31:18,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:31:18,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:31:18,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:31:18,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:31:18,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:31:18,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:31:18,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:31:18,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:31:18,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:31:18,831 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:31:18,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:31:18,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:31:18,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:31:18,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:31:18,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:31:18,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:31:18,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:31:18,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:31:18,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:31:18,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:31:18,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:31:18,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:31:18,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:31:18,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:31:18,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:31:18,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:31:18,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:31:18,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:31:18,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:31:18,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:31:18,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:31:18,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:31:18,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:31:18,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:31:18,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:31:18,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:31:18,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:31:18,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49ff6ba228d081d26cec6b087caf15954318cb178107abc089cabcbe5599946d [2024-10-10 23:31:19,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:31:19,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:31:19,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:31:19,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:31:19,137 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:31:19,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2024-10-10 23:31:20,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:31:21,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:31:21,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2024-10-10 23:31:21,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26e4a9636/e7b509d84df5481abee9193d5ab5299a/FLAG1f2ebed64 [2024-10-10 23:31:21,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26e4a9636/e7b509d84df5481abee9193d5ab5299a [2024-10-10 23:31:21,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:31:21,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:31:21,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:31:21,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:31:21,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:31:21,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:21" (1/1) ... [2024-10-10 23:31:21,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67691d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:21, skipping insertion in model container [2024-10-10 23:31:21,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:21" (1/1) ... [2024-10-10 23:31:21,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:31:21,599 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_label54.c[4044,4057] [2024-10-10 23:31:22,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:31:22,492 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:31:22,515 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_label54.c[4044,4057] [2024-10-10 23:31:23,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:31:23,030 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:31:23,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23 WrapperNode [2024-10-10 23:31:23,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:31:23,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:31:23,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:31:23,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:31:23,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:23,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:23,691 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:31:23,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:31:23,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:31:23,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:31:23,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:31:23,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:23,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:23,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,086 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-10 23:31:24,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:31:24,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:31:24,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:31:24,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:31:24,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (1/1) ... [2024-10-10 23:31:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:31:24,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:31:24,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:31:24,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:31:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:31:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:31:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:31:24,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:31:24,949 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:31:24,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:31:30,954 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:31:30,955 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:31:31,032 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:31:31,033 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:31:31,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:31 BoogieIcfgContainer [2024-10-10 23:31:31,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:31:31,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:31:31,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:31:31,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:31:31,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:31:21" (1/3) ... [2024-10-10 23:31:31,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b0d27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:31, skipping insertion in model container [2024-10-10 23:31:31,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:23" (2/3) ... [2024-10-10 23:31:31,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b0d27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:31, skipping insertion in model container [2024-10-10 23:31:31,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:31" (3/3) ... [2024-10-10 23:31:31,042 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label54.c [2024-10-10 23:31:31,059 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:31:31,060 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:31:31,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:31:31,175 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;@27f659db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:31:31,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:31:31,185 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-10 23:31:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 23:31:31,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:31,193 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] [2024-10-10 23:31:31,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:31,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash 231807794, now seen corresponding path program 1 times [2024-10-10 23:31:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119364348] [2024-10-10 23:31:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:31,398 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-10 23:31:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119364348] [2024-10-10 23:31:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119364348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:31,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337946640] [2024-10-10 23:31:31,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:31,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:31:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:31:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:31:31,439 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-10 23:31:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:31,564 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:31:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:31:31,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-10 23:31:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:31,592 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:31:31,593 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:31:31,601 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-10 23:31:31,609 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-10 23:31:31,611 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-10 23:31:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:31:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:31:31,718 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-10 23:31:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:31:31,724 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 26 [2024-10-10 23:31:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:31,725 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:31:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-10 23:31:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:31:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 23:31:31,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:31,726 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] [2024-10-10 23:31:31,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:31:31,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 358221368, now seen corresponding path program 1 times [2024-10-10 23:31:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:31,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733607048] [2024-10-10 23:31:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:32,004 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-10 23:31:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733607048] [2024-10-10 23:31:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733607048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757846419] [2024-10-10 23:31:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:32,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:32,009 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-10 23:31:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:35,701 INFO L93 Difference]: Finished difference Result 2996 states and 5467 transitions. [2024-10-10 23:31:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-10 23:31:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:35,719 INFO L225 Difference]: With dead ends: 2996 [2024-10-10 23:31:35,723 INFO L226 Difference]: Without dead ends: 1963 [2024-10-10 23:31:35,728 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-10 23:31:35,729 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 1128 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:35,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 945 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-10 23:31:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2024-10-10 23:31:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1950. [2024-10-10 23:31:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.6541816316059517) internal successors, (3224), 1949 states have internal predecessors, (3224), 0 states have call successors, (0), 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-10 23:31:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3224 transitions. [2024-10-10 23:31:35,809 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3224 transitions. Word has length 26 [2024-10-10 23:31:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:35,810 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 3224 transitions. [2024-10-10 23:31:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-10 23:31:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3224 transitions. [2024-10-10 23:31:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-10 23:31:35,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:35,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:31:35,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:31:35,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1429247058, now seen corresponding path program 1 times [2024-10-10 23:31:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400292706] [2024-10-10 23:31:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400292706] [2024-10-10 23:31:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400292706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430855068] [2024-10-10 23:31:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:36,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:36,077 INFO L87 Difference]: Start difference. First operand 1950 states and 3224 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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-10 23:31:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:40,540 INFO L93 Difference]: Finished difference Result 5541 states and 9221 transitions. [2024-10-10 23:31:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-10-10 23:31:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:40,555 INFO L225 Difference]: With dead ends: 5541 [2024-10-10 23:31:40,555 INFO L226 Difference]: Without dead ends: 3592 [2024-10-10 23:31:40,559 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-10 23:31:40,560 INFO L432 NwaCegarLoop]: 870 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:40,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1007 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-10 23:31:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2024-10-10 23:31:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3580. [2024-10-10 23:31:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 1.5051690416317407) internal successors, (5387), 3579 states have internal predecessors, (5387), 0 states have call successors, (0), 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-10 23:31:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5387 transitions. [2024-10-10 23:31:40,635 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5387 transitions. Word has length 97 [2024-10-10 23:31:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5387 transitions. [2024-10-10 23:31:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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-10 23:31:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5387 transitions. [2024-10-10 23:31:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-10 23:31:40,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:40,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:31:40,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:31:40,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:40,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 331052725, now seen corresponding path program 1 times [2024-10-10 23:31:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:40,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547126875] [2024-10-10 23:31:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547126875] [2024-10-10 23:31:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547126875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:40,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834821545] [2024-10-10 23:31:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:40,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:40,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:40,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:40,815 INFO L87 Difference]: Start difference. First operand 3580 states and 5387 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:43,943 INFO L93 Difference]: Finished difference Result 10351 states and 15624 transitions. [2024-10-10 23:31:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:43,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-10 23:31:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:43,969 INFO L225 Difference]: With dead ends: 10351 [2024-10-10 23:31:43,970 INFO L226 Difference]: Without dead ends: 6772 [2024-10-10 23:31:43,978 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-10 23:31:43,979 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:43,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1170 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:31:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2024-10-10 23:31:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6748. [2024-10-10 23:31:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6748 states, 6747 states have (on average 1.3253297761968281) internal successors, (8942), 6747 states have internal predecessors, (8942), 0 states have call successors, (0), 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-10 23:31:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6748 states to 6748 states and 8942 transitions. [2024-10-10 23:31:44,232 INFO L78 Accepts]: Start accepts. Automaton has 6748 states and 8942 transitions. Word has length 111 [2024-10-10 23:31:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:44,232 INFO L471 AbstractCegarLoop]: Abstraction has 6748 states and 8942 transitions. [2024-10-10 23:31:44,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6748 states and 8942 transitions. [2024-10-10 23:31:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-10 23:31:44,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:44,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:31:44,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:31:44,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1298196711, now seen corresponding path program 1 times [2024-10-10 23:31:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846066489] [2024-10-10 23:31:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:44,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846066489] [2024-10-10 23:31:44,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846066489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:44,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807678695] [2024-10-10 23:31:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:44,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:44,508 INFO L87 Difference]: Start difference. First operand 6748 states and 8942 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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-10 23:31:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:47,631 INFO L93 Difference]: Finished difference Result 19803 states and 26219 transitions. [2024-10-10 23:31:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:47,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-10-10 23:31:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:47,670 INFO L225 Difference]: With dead ends: 19803 [2024-10-10 23:31:47,671 INFO L226 Difference]: Without dead ends: 13056 [2024-10-10 23:31:47,683 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-10 23:31:47,684 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:47,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1033 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:31:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13056 states. [2024-10-10 23:31:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13056 to 13051. [2024-10-10 23:31:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13051 states, 13050 states have (on average 1.2179310344827585) internal successors, (15894), 13050 states have internal predecessors, (15894), 0 states have call successors, (0), 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-10 23:31:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13051 states to 13051 states and 15894 transitions. [2024-10-10 23:31:47,934 INFO L78 Accepts]: Start accepts. Automaton has 13051 states and 15894 transitions. Word has length 140 [2024-10-10 23:31:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 13051 states and 15894 transitions. [2024-10-10 23:31:47,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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-10 23:31:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13051 states and 15894 transitions. [2024-10-10 23:31:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-10 23:31:47,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:47,942 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:31:47,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:31:47,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:47,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -93705797, now seen corresponding path program 1 times [2024-10-10 23:31:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:47,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595990615] [2024-10-10 23:31:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 23:31:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595990615] [2024-10-10 23:31:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595990615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449066840] [2024-10-10 23:31:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:48,557 INFO L87 Difference]: Start difference. First operand 13051 states and 15894 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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-10 23:31:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:51,323 INFO L93 Difference]: Finished difference Result 26888 states and 32589 transitions. [2024-10-10 23:31:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:51,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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 218 [2024-10-10 23:31:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:51,363 INFO L225 Difference]: With dead ends: 26888 [2024-10-10 23:31:51,363 INFO L226 Difference]: Without dead ends: 13838 [2024-10-10 23:31:51,382 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-10 23:31:51,383 INFO L432 NwaCegarLoop]: 1082 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:51,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1211 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:31:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2024-10-10 23:31:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 13838. [2024-10-10 23:31:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13838 states, 13837 states have (on average 1.2058972320589723) internal successors, (16686), 13837 states have internal predecessors, (16686), 0 states have call successors, (0), 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-10 23:31:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13838 states to 13838 states and 16686 transitions. [2024-10-10 23:31:51,670 INFO L78 Accepts]: Start accepts. Automaton has 13838 states and 16686 transitions. Word has length 218 [2024-10-10 23:31:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 13838 states and 16686 transitions. [2024-10-10 23:31:51,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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-10 23:31:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13838 states and 16686 transitions. [2024-10-10 23:31:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-10 23:31:51,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:51,675 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:31:51,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:31:51,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2001769124, now seen corresponding path program 1 times [2024-10-10 23:31:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734729269] [2024-10-10 23:31:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734729269] [2024-10-10 23:31:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734729269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:51,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751284059] [2024-10-10 23:31:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:51,878 INFO L87 Difference]: Start difference. First operand 13838 states and 16686 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-10 23:31:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:55,359 INFO L93 Difference]: Finished difference Result 33199 states and 41057 transitions. [2024-10-10 23:31:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-10-10 23:31:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:55,391 INFO L225 Difference]: With dead ends: 33199 [2024-10-10 23:31:55,392 INFO L226 Difference]: Without dead ends: 20149 [2024-10-10 23:31:55,408 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-10 23:31:55,409 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 860 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:55,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 941 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:31:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20149 states. [2024-10-10 23:31:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20149 to 20139. [2024-10-10 23:31:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20139 states, 20138 states have (on average 1.1898897606515046) internal successors, (23962), 20138 states have internal predecessors, (23962), 0 states have call successors, (0), 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-10 23:31:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20139 states to 20139 states and 23962 transitions. [2024-10-10 23:31:55,685 INFO L78 Accepts]: Start accepts. Automaton has 20139 states and 23962 transitions. Word has length 225 [2024-10-10 23:31:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:55,686 INFO L471 AbstractCegarLoop]: Abstraction has 20139 states and 23962 transitions. [2024-10-10 23:31:55,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-10 23:31:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20139 states and 23962 transitions. [2024-10-10 23:31:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-10 23:31:55,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:55,690 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:31:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:31:55,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash -405941161, now seen corresponding path program 1 times [2024-10-10 23:31:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950153915] [2024-10-10 23:31:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:55,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:55,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950153915] [2024-10-10 23:31:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950153915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509278706] [2024-10-10 23:31:55,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:55,888 INFO L87 Difference]: Start difference. First operand 20139 states and 23962 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-10 23:31:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:58,732 INFO L93 Difference]: Finished difference Result 39360 states and 46952 transitions. [2024-10-10 23:31:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2024-10-10 23:31:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:58,765 INFO L225 Difference]: With dead ends: 39360 [2024-10-10 23:31:58,765 INFO L226 Difference]: Without dead ends: 20009 [2024-10-10 23:31:58,787 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-10 23:31:58,788 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 1037 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:58,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1639 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:31:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20009 states. [2024-10-10 23:31:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20009 to 19219. [2024-10-10 23:31:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19219 states, 19218 states have (on average 1.1321677593922364) internal successors, (21758), 19218 states have internal predecessors, (21758), 0 states have call successors, (0), 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-10 23:31:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19219 states to 19219 states and 21758 transitions. [2024-10-10 23:31:59,228 INFO L78 Accepts]: Start accepts. Automaton has 19219 states and 21758 transitions. Word has length 240 [2024-10-10 23:31:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:59,228 INFO L471 AbstractCegarLoop]: Abstraction has 19219 states and 21758 transitions. [2024-10-10 23:31:59,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-10 23:31:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 19219 states and 21758 transitions. [2024-10-10 23:31:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-10-10 23:31:59,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:59,234 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10 23:31:59,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:31:59,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:59,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1695475449, now seen corresponding path program 1 times [2024-10-10 23:31:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:59,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069006517] [2024-10-10 23:31:59,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:59,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:31:59,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069006517] [2024-10-10 23:31:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069006517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:59,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:59,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142591931] [2024-10-10 23:31:59,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:59,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:59,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:59,498 INFO L87 Difference]: Start difference. First operand 19219 states and 21758 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:02,748 INFO L93 Difference]: Finished difference Result 43954 states and 50451 transitions. [2024-10-10 23:32:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:02,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2024-10-10 23:32:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:02,780 INFO L225 Difference]: With dead ends: 43954 [2024-10-10 23:32:02,780 INFO L226 Difference]: Without dead ends: 25523 [2024-10-10 23:32:02,794 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-10 23:32:02,795 INFO L432 NwaCegarLoop]: 1775 mSDtfsCounter, 841 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:02,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1916 Invalid, 3253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:32:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25523 states. [2024-10-10 23:32:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25523 to 24732. [2024-10-10 23:32:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24732 states, 24731 states have (on average 1.1185960939711292) internal successors, (27664), 24731 states have internal predecessors, (27664), 0 states have call successors, (0), 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-10 23:32:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24732 states to 24732 states and 27664 transitions. [2024-10-10 23:32:03,173 INFO L78 Accepts]: Start accepts. Automaton has 24732 states and 27664 transitions. Word has length 314 [2024-10-10 23:32:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:03,174 INFO L471 AbstractCegarLoop]: Abstraction has 24732 states and 27664 transitions. [2024-10-10 23:32:03,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 24732 states and 27664 transitions. [2024-10-10 23:32:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-10 23:32:03,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:03,180 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:32:03,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -947988761, now seen corresponding path program 1 times [2024-10-10 23:32:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161281751] [2024-10-10 23:32:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 23:32:03,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:03,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161281751] [2024-10-10 23:32:03,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161281751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:03,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:03,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:03,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899772752] [2024-10-10 23:32:03,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:03,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:03,445 INFO L87 Difference]: Start difference. First operand 24732 states and 27664 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-10 23:32:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:09,555 INFO L93 Difference]: Finished difference Result 91375 states and 102286 transitions. [2024-10-10 23:32:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:09,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 323 [2024-10-10 23:32:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:09,649 INFO L225 Difference]: With dead ends: 91375 [2024-10-10 23:32:09,649 INFO L226 Difference]: Without dead ends: 67431 [2024-10-10 23:32:09,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:09,675 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 1718 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 6002 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 7100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 6002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:09,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 761 Invalid, 7100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 6002 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-10 23:32:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67431 states. [2024-10-10 23:32:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67431 to 64948. [2024-10-10 23:32:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64948 states, 64947 states have (on average 1.1045621814710456) internal successors, (71738), 64947 states have internal predecessors, (71738), 0 states have call successors, (0), 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-10 23:32:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64948 states to 64948 states and 71738 transitions. [2024-10-10 23:32:10,445 INFO L78 Accepts]: Start accepts. Automaton has 64948 states and 71738 transitions. Word has length 323 [2024-10-10 23:32:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:10,446 INFO L471 AbstractCegarLoop]: Abstraction has 64948 states and 71738 transitions. [2024-10-10 23:32:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-10 23:32:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 64948 states and 71738 transitions. [2024-10-10 23:32:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-10 23:32:10,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:10,451 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:10,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:32:10,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash -707130468, now seen corresponding path program 1 times [2024-10-10 23:32:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692541226] [2024-10-10 23:32:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-10 23:32:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692541226] [2024-10-10 23:32:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692541226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:10,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297502043] [2024-10-10 23:32:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:10,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:10,795 INFO L87 Difference]: Start difference. First operand 64948 states and 71738 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:14,006 INFO L93 Difference]: Finished difference Result 142509 states and 156965 transitions. [2024-10-10 23:32:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2024-10-10 23:32:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:14,085 INFO L225 Difference]: With dead ends: 142509 [2024-10-10 23:32:14,085 INFO L226 Difference]: Without dead ends: 77562 [2024-10-10 23:32:14,125 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-10 23:32:14,126 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 728 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:14,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1173 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:32:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77562 states. [2024-10-10 23:32:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77562 to 75977. [2024-10-10 23:32:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75977 states, 75976 states have (on average 1.0951484679372434) internal successors, (83205), 75976 states have internal predecessors, (83205), 0 states have call successors, (0), 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-10 23:32:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75977 states to 75977 states and 83205 transitions. [2024-10-10 23:32:15,082 INFO L78 Accepts]: Start accepts. Automaton has 75977 states and 83205 transitions. Word has length 323 [2024-10-10 23:32:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 75977 states and 83205 transitions. [2024-10-10 23:32:15,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 75977 states and 83205 transitions. [2024-10-10 23:32:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-10 23:32:15,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:15,090 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:15,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:32:15,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1124834510, now seen corresponding path program 1 times [2024-10-10 23:32:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002800572] [2024-10-10 23:32:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 23:32:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002800572] [2024-10-10 23:32:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002800572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901742681] [2024-10-10 23:32:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:16,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:16,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:16,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:16,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:32:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:17,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:17,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-10 23:32:17,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901742681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:32:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244227013] [2024-10-10 23:32:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:32:17,385 INFO L87 Difference]: Start difference. First operand 75977 states and 83205 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-10 23:32:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:20,510 INFO L93 Difference]: Finished difference Result 151164 states and 165616 transitions. [2024-10-10 23:32:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 352 [2024-10-10 23:32:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:20,607 INFO L225 Difference]: With dead ends: 151164 [2024-10-10 23:32:20,607 INFO L226 Difference]: Without dead ends: 75975 [2024-10-10 23:32:20,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:32:20,644 INFO L432 NwaCegarLoop]: 1339 mSDtfsCounter, 1112 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:20,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1417 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:32:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75975 states. [2024-10-10 23:32:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75975 to 75974. [2024-10-10 23:32:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75974 states, 75973 states have (on average 1.075869058744554) internal successors, (81737), 75973 states have internal predecessors, (81737), 0 states have call successors, (0), 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-10 23:32:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75974 states to 75974 states and 81737 transitions. [2024-10-10 23:32:21,746 INFO L78 Accepts]: Start accepts. Automaton has 75974 states and 81737 transitions. Word has length 352 [2024-10-10 23:32:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 75974 states and 81737 transitions. [2024-10-10 23:32:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-10 23:32:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 75974 states and 81737 transitions. [2024-10-10 23:32:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:32:21,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:21,759 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:21,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:32:21,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:32:21,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1949962769, now seen corresponding path program 1 times [2024-10-10 23:32:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240716892] [2024-10-10 23:32:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:32:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240716892] [2024-10-10 23:32:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240716892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622210498] [2024-10-10 23:32:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:22,364 INFO L87 Difference]: Start difference. First operand 75974 states and 81737 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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-10 23:32:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:26,269 INFO L93 Difference]: Finished difference Result 171630 states and 185875 transitions. [2024-10-10 23:32:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:26,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 382 [2024-10-10 23:32:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:26,384 INFO L225 Difference]: With dead ends: 171630 [2024-10-10 23:32:26,384 INFO L226 Difference]: Without dead ends: 96444 [2024-10-10 23:32:26,404 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-10 23:32:26,405 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 890 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 934 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 934 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:26,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 879 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [934 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:32:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96444 states. [2024-10-10 23:32:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96444 to 93278. [2024-10-10 23:32:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93278 states, 93277 states have (on average 1.0808237829261234) internal successors, (100816), 93277 states have internal predecessors, (100816), 0 states have call successors, (0), 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-10 23:32:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93278 states to 93278 states and 100816 transitions. [2024-10-10 23:32:27,464 INFO L78 Accepts]: Start accepts. Automaton has 93278 states and 100816 transitions. Word has length 382 [2024-10-10 23:32:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:27,465 INFO L471 AbstractCegarLoop]: Abstraction has 93278 states and 100816 transitions. [2024-10-10 23:32:27,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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-10 23:32:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 93278 states and 100816 transitions. [2024-10-10 23:32:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-10-10 23:32:27,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:27,699 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:32:27,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:32:27,700 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:27,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:27,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2093857876, now seen corresponding path program 1 times [2024-10-10 23:32:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345757532] [2024-10-10 23:32:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:32:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345757532] [2024-10-10 23:32:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345757532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2515148] [2024-10-10 23:32:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:28,239 INFO L87 Difference]: Start difference. First operand 93278 states and 100816 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-10 23:32:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:31,821 INFO L93 Difference]: Finished difference Result 185776 states and 200857 transitions. [2024-10-10 23:32:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:31,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 420 [2024-10-10 23:32:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:31,928 INFO L225 Difference]: With dead ends: 185776 [2024-10-10 23:32:31,928 INFO L226 Difference]: Without dead ends: 93286 [2024-10-10 23:32:31,965 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-10 23:32:31,965 INFO L432 NwaCegarLoop]: 1697 mSDtfsCounter, 794 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:31,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1838 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:32:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93286 states. [2024-10-10 23:32:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93286 to 92481. [2024-10-10 23:32:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92481 states, 92480 states have (on average 1.0581206747404843) internal successors, (97855), 92480 states have internal predecessors, (97855), 0 states have call successors, (0), 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-10 23:32:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92481 states to 92481 states and 97855 transitions. [2024-10-10 23:32:33,188 INFO L78 Accepts]: Start accepts. Automaton has 92481 states and 97855 transitions. Word has length 420 [2024-10-10 23:32:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 92481 states and 97855 transitions. [2024-10-10 23:32:33,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-10 23:32:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 92481 states and 97855 transitions. [2024-10-10 23:32:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-10-10 23:32:33,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:33,203 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:32:33,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:32:33,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:33,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -644646087, now seen corresponding path program 1 times [2024-10-10 23:32:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986530381] [2024-10-10 23:32:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 290 proven. 110 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 23:32:34,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986530381] [2024-10-10 23:32:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986530381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882921009] [2024-10-10 23:32:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:34,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:34,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:32:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:34,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:34,974 INFO L278 TraceCheckSpWp]: Computing forward predicates...