./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/Problem17_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:26:10,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:26:10,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:26:10,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:26:10,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:26:10,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:26:10,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:26:10,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:26:10,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:26:10,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:26:10,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:26:10,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:26:10,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:26:10,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:26:10,802 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:26:10,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:26:10,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:26:10,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:26:10,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:26:10,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:26:10,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:26:10,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:26:10,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:26:10,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:26:10,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:26:10,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:26:10,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:26:10,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:26:10,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:26:10,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:26:10,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:26:10,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:26:10,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:26:10,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:26:10,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:26:10,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:26:10,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:26:10,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:26:10,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:26:10,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:26:10,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:26:10,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:26:10,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 [2024-10-12 16:26:11,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:26:11,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:26:11,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:26:11,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:26:11,118 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:26:11,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2024-10-12 16:26:12,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:26:13,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:26:13,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2024-10-12 16:26:13,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cddc01b63/1a58a7afbdea4518a6a3a44da13c27e0/FLAG5487c560d [2024-10-12 16:26:13,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cddc01b63/1a58a7afbdea4518a6a3a44da13c27e0 [2024-10-12 16:26:13,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:26:13,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:26:13,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:26:13,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:26:13,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:26:13,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:26:13" (1/1) ... [2024-10-12 16:26:13,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7149df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:13, skipping insertion in model container [2024-10-12 16:26:13,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:26:13" (1/1) ... [2024-10-12 16:26:13,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:26:13,458 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/Problem17_label02.c[7859,7872] [2024-10-12 16:26:13,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:26:13,983 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:26:14,015 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/Problem17_label02.c[7859,7872] [2024-10-12 16:26:14,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:26:14,253 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:26:14,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14 WrapperNode [2024-10-12 16:26:14,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:26:14,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:26:14,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:26:14,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:26:14,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:14,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:14,603 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-12 16:26:14,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:26:14,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:26:14,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:26:14,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:26:14,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:14,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:14,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:14,859 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-12 16:26:14,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:14,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:15,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:15,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:15,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:15,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:15,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:26:15,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:26:15,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:26:15,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:26:15,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (1/1) ... [2024-10-12 16:26:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:26:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:15,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:26:15,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:26:15,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:26:15,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:26:15,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:26:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:26:15,299 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:26:15,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:26:18,610 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-12 16:26:18,611 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:26:18,680 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:26:18,682 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:26:18,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:18 BoogieIcfgContainer [2024-10-12 16:26:18,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:26:18,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:26:18,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:26:18,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:26:18,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:26:13" (1/3) ... [2024-10-12 16:26:18,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c13651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:26:18, skipping insertion in model container [2024-10-12 16:26:18,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:14" (2/3) ... [2024-10-12 16:26:18,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c13651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:26:18, skipping insertion in model container [2024-10-12 16:26:18,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:18" (3/3) ... [2024-10-12 16:26:18,693 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label02.c [2024-10-12 16:26:18,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:26:18,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:26:18,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:26:18,799 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;@69fe1672, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:26:18,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:26:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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-12 16:26:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 16:26:18,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:18,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:18,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:18,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:18,822 INFO L85 PathProgramCache]: Analyzing trace with hash 966379391, now seen corresponding path program 1 times [2024-10-12 16:26:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509398218] [2024-10-12 16:26:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:19,027 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-12 16:26:19,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509398218] [2024-10-12 16:26:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509398218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:19,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:19,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690214389] [2024-10-12 16:26:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:26:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:26:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:26:19,068 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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-12 16:26:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:19,154 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-12 16:26:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:26:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 16:26:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:19,178 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 16:26:19,179 INFO L226 Difference]: Without dead ends: 526 [2024-10-12 16:26:19,184 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-12 16:26:19,189 INFO L432 NwaCegarLoop]: 935 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, 935 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-12 16:26:19,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:26:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-12 16:26:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-12 16:26:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 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-12 16:26:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-12 16:26:19,266 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 52 [2024-10-12 16:26:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:19,267 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-12 16:26:19,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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-12 16:26:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-12 16:26:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 16:26:19,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:19,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:19,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:26:19,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:19,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -548240351, now seen corresponding path program 1 times [2024-10-12 16:26:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608716865] [2024-10-12 16:26:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:19,473 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-12 16:26:19,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:19,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608716865] [2024-10-12 16:26:19,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608716865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:19,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:19,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:19,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65909968] [2024-10-12 16:26:19,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:19,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:19,478 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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-12 16:26:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:21,732 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-12 16:26:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:21,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 16:26:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:21,738 INFO L225 Difference]: With dead ends: 1501 [2024-10-12 16:26:21,738 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 16:26:21,739 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-12 16:26:21,740 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 419 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:21,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:26:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 16:26:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-12 16:26:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 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-12 16:26:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-12 16:26:21,775 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 52 [2024-10-12 16:26:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:21,776 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-12 16:26:21,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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-12 16:26:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-12 16:26:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 16:26:21,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:21,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:21,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:26:21,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:21,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:21,781 INFO L85 PathProgramCache]: Analyzing trace with hash -539654982, now seen corresponding path program 1 times [2024-10-12 16:26:21,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:21,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147326954] [2024-10-12 16:26:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:21,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:22,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:22,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147326954] [2024-10-12 16:26:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147326954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:22,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:22,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235098535] [2024-10-12 16:26:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:22,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:22,065 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-12 16:26:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:24,133 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-12 16:26:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-12 16:26:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:24,143 INFO L225 Difference]: With dead ends: 2812 [2024-10-12 16:26:24,144 INFO L226 Difference]: Without dead ends: 1843 [2024-10-12 16:26:24,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:24,147 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:24,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 16:26:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-12 16:26:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-12 16:26:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 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-12 16:26:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-12 16:26:24,201 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 119 [2024-10-12 16:26:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:24,203 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-12 16:26:24,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-12 16:26:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-12 16:26:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 16:26:24,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:24,210 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 16:26:24,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:26:24,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:24,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1953207092, now seen corresponding path program 1 times [2024-10-12 16:26:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:24,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339843444] [2024-10-12 16:26:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339843444] [2024-10-12 16:26:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339843444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:24,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:24,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898866643] [2024-10-12 16:26:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:24,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:26:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:26:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:26:24,699 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-12 16:26:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:28,199 INFO L93 Difference]: Finished difference Result 6764 states and 9257 transitions. [2024-10-12 16:26:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:26:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-12 16:26:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:28,218 INFO L225 Difference]: With dead ends: 6764 [2024-10-12 16:26:28,218 INFO L226 Difference]: Without dead ends: 4925 [2024-10-12 16:26:28,223 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-12 16:26:28,224 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 859 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:28,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 326 Invalid, 3384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 16:26:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2024-10-12 16:26:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4874. [2024-10-12 16:26:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.286476503180792) internal successors, (6269), 4873 states have internal predecessors, (6269), 0 states have call successors, (0), 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-12 16:26:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6269 transitions. [2024-10-12 16:26:28,323 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6269 transitions. Word has length 122 [2024-10-12 16:26:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:28,324 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 6269 transitions. [2024-10-12 16:26:28,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-12 16:26:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6269 transitions. [2024-10-12 16:26:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-12 16:26:28,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:28,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:28,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:26:28,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:28,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:28,330 INFO L85 PathProgramCache]: Analyzing trace with hash -220652911, now seen corresponding path program 1 times [2024-10-12 16:26:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580747816] [2024-10-12 16:26:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 16:26:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:28,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580747816] [2024-10-12 16:26:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580747816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475276776] [2024-10-12 16:26:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:28,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:28,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:28,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:28,571 INFO L87 Difference]: Start difference. First operand 4874 states and 6269 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-12 16:26:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:30,276 INFO L93 Difference]: Finished difference Result 14435 states and 18540 transitions. [2024-10-12 16:26:30,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:30,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 193 [2024-10-12 16:26:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:30,302 INFO L225 Difference]: With dead ends: 14435 [2024-10-12 16:26:30,302 INFO L226 Difference]: Without dead ends: 8276 [2024-10-12 16:26:30,309 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-12 16:26:30,310 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:30,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 588 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:26:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2024-10-12 16:26:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6146. [2024-10-12 16:26:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6146 states, 6145 states have (on average 1.1907241659886085) internal successors, (7317), 6145 states have internal predecessors, (7317), 0 states have call successors, (0), 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-12 16:26:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6146 states to 6146 states and 7317 transitions. [2024-10-12 16:26:30,424 INFO L78 Accepts]: Start accepts. Automaton has 6146 states and 7317 transitions. Word has length 193 [2024-10-12 16:26:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:30,425 INFO L471 AbstractCegarLoop]: Abstraction has 6146 states and 7317 transitions. [2024-10-12 16:26:30,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-12 16:26:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6146 states and 7317 transitions. [2024-10-12 16:26:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-12 16:26:30,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:30,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:30,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:26:30,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:30,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash -688032605, now seen corresponding path program 1 times [2024-10-12 16:26:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081181779] [2024-10-12 16:26:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:26:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081181779] [2024-10-12 16:26:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081181779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:30,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:30,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356295706] [2024-10-12 16:26:30,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:30,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:30,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:30,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:30,661 INFO L87 Difference]: Start difference. First operand 6146 states and 7317 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-12 16:26:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:32,278 INFO L93 Difference]: Finished difference Result 15691 states and 18896 transitions. [2024-10-12 16:26:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:32,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 206 [2024-10-12 16:26:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:32,306 INFO L225 Difference]: With dead ends: 15691 [2024-10-12 16:26:32,306 INFO L226 Difference]: Without dead ends: 9546 [2024-10-12 16:26:32,316 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-12 16:26:32,319 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 406 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:32,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 475 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9546 states. [2024-10-12 16:26:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9546 to 6123. [2024-10-12 16:26:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6123 states, 6122 states have (on average 1.1894805619078732) internal successors, (7282), 6122 states have internal predecessors, (7282), 0 states have call successors, (0), 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-12 16:26:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 7282 transitions. [2024-10-12 16:26:32,435 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 7282 transitions. Word has length 206 [2024-10-12 16:26:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:32,436 INFO L471 AbstractCegarLoop]: Abstraction has 6123 states and 7282 transitions. [2024-10-12 16:26:32,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-12 16:26:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 7282 transitions. [2024-10-12 16:26:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-12 16:26:32,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:32,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-10-12 16:26:32,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:26:32,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -359383224, now seen corresponding path program 1 times [2024-10-12 16:26:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:32,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333072286] [2024-10-12 16:26:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:32,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333072286] [2024-10-12 16:26:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333072286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:32,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:32,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292474580] [2024-10-12 16:26:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:32,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:32,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:32,639 INFO L87 Difference]: Start difference. First operand 6123 states and 7282 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-12 16:26:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:34,232 INFO L93 Difference]: Finished difference Result 16077 states and 19443 transitions. [2024-10-12 16:26:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 213 [2024-10-12 16:26:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:34,258 INFO L225 Difference]: With dead ends: 16077 [2024-10-12 16:26:34,259 INFO L226 Difference]: Without dead ends: 9955 [2024-10-12 16:26:34,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:34,267 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 487 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:34,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 785 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9955 states. [2024-10-12 16:26:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9955 to 9955. [2024-10-12 16:26:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9955 states, 9954 states have (on average 1.1716897729555957) internal successors, (11663), 9954 states have internal predecessors, (11663), 0 states have call successors, (0), 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-12 16:26:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9955 states to 9955 states and 11663 transitions. [2024-10-12 16:26:34,417 INFO L78 Accepts]: Start accepts. Automaton has 9955 states and 11663 transitions. Word has length 213 [2024-10-12 16:26:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 9955 states and 11663 transitions. [2024-10-12 16:26:34,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-12 16:26:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9955 states and 11663 transitions. [2024-10-12 16:26:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-12 16:26:34,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:34,422 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:26:34,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1999402442, now seen corresponding path program 1 times [2024-10-12 16:26:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854201683] [2024-10-12 16:26:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 16:26:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854201683] [2024-10-12 16:26:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854201683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000659775] [2024-10-12 16:26:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:34,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:26:34,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:34,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:26:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:26:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:35,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:26:35,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:26:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 16:26:35,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:26:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 16:26:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000659775] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:35,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:26:35,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-12 16:26:35,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077056829] [2024-10-12 16:26:35,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:35,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:26:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:35,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:26:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:26:35,676 INFO L87 Difference]: Start difference. First operand 9955 states and 11663 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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-12 16:26:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:39,059 INFO L93 Difference]: Finished difference Result 30574 states and 36166 transitions. [2024-10-12 16:26:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:26:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 276 [2024-10-12 16:26:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:39,094 INFO L225 Difference]: With dead ends: 30574 [2024-10-12 16:26:39,094 INFO L226 Difference]: Without dead ends: 19762 [2024-10-12 16:26:39,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:26:39,111 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1070 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 1228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1228 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:39,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 144 Invalid, 3471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1228 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:26:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2024-10-12 16:26:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 19759. [2024-10-12 16:26:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19759 states, 19758 states have (on average 1.1599858285251543) internal successors, (22919), 19758 states have internal predecessors, (22919), 0 states have call successors, (0), 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-12 16:26:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19759 states to 19759 states and 22919 transitions. [2024-10-12 16:26:39,503 INFO L78 Accepts]: Start accepts. Automaton has 19759 states and 22919 transitions. Word has length 276 [2024-10-12 16:26:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:39,503 INFO L471 AbstractCegarLoop]: Abstraction has 19759 states and 22919 transitions. [2024-10-12 16:26:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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-12 16:26:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19759 states and 22919 transitions. [2024-10-12 16:26:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-12 16:26:39,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:39,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:39,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:26:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:26:39,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:39,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2107349714, now seen corresponding path program 1 times [2024-10-12 16:26:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583598680] [2024-10-12 16:26:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:26:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583598680] [2024-10-12 16:26:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583598680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:39,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820125791] [2024-10-12 16:26:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:39,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:39,944 INFO L87 Difference]: Start difference. First operand 19759 states and 22919 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:41,605 INFO L93 Difference]: Finished difference Result 42908 states and 49988 transitions. [2024-10-12 16:26:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:41,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2024-10-12 16:26:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:41,653 INFO L225 Difference]: With dead ends: 42908 [2024-10-12 16:26:41,653 INFO L226 Difference]: Without dead ends: 23150 [2024-10-12 16:26:41,676 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-12 16:26:41,678 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 374 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:41,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 893 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23150 states. [2024-10-12 16:26:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23150 to 22724. [2024-10-12 16:26:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22724 states, 22723 states have (on average 1.1456233771949127) internal successors, (26032), 22723 states have internal predecessors, (26032), 0 states have call successors, (0), 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-12 16:26:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22724 states to 22724 states and 26032 transitions. [2024-10-12 16:26:42,132 INFO L78 Accepts]: Start accepts. Automaton has 22724 states and 26032 transitions. Word has length 289 [2024-10-12 16:26:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:42,132 INFO L471 AbstractCegarLoop]: Abstraction has 22724 states and 26032 transitions. [2024-10-12 16:26:42,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 22724 states and 26032 transitions. [2024-10-12 16:26:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-10-12 16:26:42,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:42,138 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-12 16:26:42,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:26:42,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash -616915401, now seen corresponding path program 1 times [2024-10-12 16:26:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929969347] [2024-10-12 16:26:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929969347] [2024-10-12 16:26:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929969347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:42,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:42,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:26:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193182881] [2024-10-12 16:26:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:42,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:26:42,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:26:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:26:42,607 INFO L87 Difference]: Start difference. First operand 22724 states and 26032 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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-12 16:26:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:45,510 INFO L93 Difference]: Finished difference Result 64236 states and 73653 transitions. [2024-10-12 16:26:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:26:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 312 [2024-10-12 16:26:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:45,557 INFO L225 Difference]: With dead ends: 64236 [2024-10-12 16:26:45,557 INFO L226 Difference]: Without dead ends: 38100 [2024-10-12 16:26:45,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12 16:26:45,581 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 853 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:45,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 368 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:26:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38100 states. [2024-10-12 16:26:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38100 to 37203. [2024-10-12 16:26:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37203 states, 37202 states have (on average 1.1374657276490512) internal successors, (42316), 37202 states have internal predecessors, (42316), 0 states have call successors, (0), 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-12 16:26:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37203 states to 37203 states and 42316 transitions. [2024-10-12 16:26:46,016 INFO L78 Accepts]: Start accepts. Automaton has 37203 states and 42316 transitions. Word has length 312 [2024-10-12 16:26:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 37203 states and 42316 transitions. [2024-10-12 16:26:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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-12 16:26:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37203 states and 42316 transitions. [2024-10-12 16:26:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 16:26:46,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:46,025 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-12 16:26:46,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:26:46,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:46,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -489797444, now seen corresponding path program 1 times [2024-10-12 16:26:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968345635] [2024-10-12 16:26:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 16:26:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968345635] [2024-10-12 16:26:46,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968345635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:46,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18126781] [2024-10-12 16:26:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:46,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:46,475 INFO L87 Difference]: Start difference. First operand 37203 states and 42316 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-12 16:26:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:48,379 INFO L93 Difference]: Finished difference Result 90181 states and 102745 transitions. [2024-10-12 16:26:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 327 [2024-10-12 16:26:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:48,446 INFO L225 Difference]: With dead ends: 90181 [2024-10-12 16:26:48,446 INFO L226 Difference]: Without dead ends: 51277 [2024-10-12 16:26:48,480 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-12 16:26:48,481 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 363 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:48,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 821 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:26:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51277 states. [2024-10-12 16:26:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51277 to 49990. [2024-10-12 16:26:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49990 states, 49989 states have (on average 1.1124647422432936) internal successors, (55611), 49989 states have internal predecessors, (55611), 0 states have call successors, (0), 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-12 16:26:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49990 states to 49990 states and 55611 transitions. [2024-10-12 16:26:49,183 INFO L78 Accepts]: Start accepts. Automaton has 49990 states and 55611 transitions. Word has length 327 [2024-10-12 16:26:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:49,183 INFO L471 AbstractCegarLoop]: Abstraction has 49990 states and 55611 transitions. [2024-10-12 16:26:49,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-12 16:26:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 49990 states and 55611 transitions. [2024-10-12 16:26:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-12 16:26:49,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:49,192 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:49,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:26:49,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:49,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2126956665, now seen corresponding path program 1 times [2024-10-12 16:26:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:49,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093440661] [2024-10-12 16:26:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 361 proven. 214 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 16:26:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093440661] [2024-10-12 16:26:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093440661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558472554] [2024-10-12 16:26:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:26:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:49,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:26:49,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:26:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:49,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:26:49,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:26:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 381 proven. 73 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-12 16:26:50,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:26:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-12 16:26:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558472554] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:26:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-10-12 16:26:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116987761] [2024-10-12 16:26:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:50,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:26:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:26:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:26:50,340 INFO L87 Difference]: Start difference. First operand 49990 states and 55611 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-12 16:26:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:53,131 INFO L93 Difference]: Finished difference Result 118727 states and 132317 transitions. [2024-10-12 16:26:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:26:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2024-10-12 16:26:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:53,199 INFO L225 Difference]: With dead ends: 118727 [2024-10-12 16:26:53,199 INFO L226 Difference]: Without dead ends: 68738 [2024-10-12 16:26:53,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:26:53,217 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 922 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:53,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 179 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:26:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68738 states. [2024-10-12 16:26:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68738 to 64907. [2024-10-12 16:26:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64907 states, 64906 states have (on average 1.1170615967707145) internal successors, (72504), 64906 states have internal predecessors, (72504), 0 states have call successors, (0), 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-12 16:26:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64907 states to 64907 states and 72504 transitions. [2024-10-12 16:26:54,075 INFO L78 Accepts]: Start accepts. Automaton has 64907 states and 72504 transitions. Word has length 350 [2024-10-12 16:26:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:54,077 INFO L471 AbstractCegarLoop]: Abstraction has 64907 states and 72504 transitions. [2024-10-12 16:26:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-12 16:26:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 64907 states and 72504 transitions. [2024-10-12 16:26:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-10-12 16:26:54,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:54,106 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-12 16:26:54,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:26:54,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 16:26:54,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:54,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:54,308 INFO L85 PathProgramCache]: Analyzing trace with hash -901941483, now seen corresponding path program 1 times [2024-10-12 16:26:54,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:54,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929391158] [2024-10-12 16:26:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:26:54,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929391158] [2024-10-12 16:26:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929391158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549724390] [2024-10-12 16:26:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:54,819 INFO L87 Difference]: Start difference. First operand 64907 states and 72504 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-12 16:26:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:56,665 INFO L93 Difference]: Finished difference Result 142174 states and 159013 transitions. [2024-10-12 16:26:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 364 [2024-10-12 16:26:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:56,752 INFO L225 Difference]: With dead ends: 142174 [2024-10-12 16:26:56,752 INFO L226 Difference]: Without dead ends: 76832 [2024-10-12 16:26:56,783 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-12 16:26:56,784 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 469 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:56,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 299 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76832 states. [2024-10-12 16:26:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76832 to 73418. [2024-10-12 16:26:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73418 states, 73417 states have (on average 1.1121266191753953) internal successors, (81649), 73417 states have internal predecessors, (81649), 0 states have call successors, (0), 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-12 16:26:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73418 states to 73418 states and 81649 transitions. [2024-10-12 16:26:57,930 INFO L78 Accepts]: Start accepts. Automaton has 73418 states and 81649 transitions. Word has length 364 [2024-10-12 16:26:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:57,930 INFO L471 AbstractCegarLoop]: Abstraction has 73418 states and 81649 transitions. [2024-10-12 16:26:57,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-12 16:26:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 73418 states and 81649 transitions. [2024-10-12 16:26:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-10-12 16:26:57,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:57,935 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-12 16:26:57,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:26:57,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1699926725, now seen corresponding path program 1 times [2024-10-12 16:26:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010214737] [2024-10-12 16:26:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-12 16:26:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010214737] [2024-10-12 16:26:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010214737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286294451] [2024-10-12 16:26:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:58,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:58,622 INFO L87 Difference]: Start difference. First operand 73418 states and 81649 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:00,494 INFO L93 Difference]: Finished difference Result 163002 states and 181527 transitions. [2024-10-12 16:27:00,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 380 [2024-10-12 16:27:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:00,580 INFO L225 Difference]: With dead ends: 163002 [2024-10-12 16:27:00,580 INFO L226 Difference]: Without dead ends: 88308 [2024-10-12 16:27:00,613 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-12 16:27:00,614 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 388 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:00,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 816 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:27:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88308 states. [2024-10-12 16:27:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88308 to 72957. [2024-10-12 16:27:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72957 states, 72956 states have (on average 1.1109572893250725) internal successors, (81051), 72956 states have internal predecessors, (81051), 0 states have call successors, (0), 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-12 16:27:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72957 states to 72957 states and 81051 transitions. [2024-10-12 16:27:01,551 INFO L78 Accepts]: Start accepts. Automaton has 72957 states and 81051 transitions. Word has length 380 [2024-10-12 16:27:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 72957 states and 81051 transitions. [2024-10-12 16:27:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 72957 states and 81051 transitions. [2024-10-12 16:27:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-10-12 16:27:01,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:01,559 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:27:01,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:01,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1280620064, now seen corresponding path program 1 times [2024-10-12 16:27:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629319874] [2024-10-12 16:27:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-12 16:27:02,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:02,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629319874] [2024-10-12 16:27:02,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629319874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:02,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:02,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:02,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453259637] [2024-10-12 16:27:02,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:02,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:02,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:02,158 INFO L87 Difference]: Start difference. First operand 72957 states and 81051 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-12 16:27:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:04,330 INFO L93 Difference]: Finished difference Result 166354 states and 185073 transitions. [2024-10-12 16:27:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 398 [2024-10-12 16:27:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:04,429 INFO L225 Difference]: With dead ends: 166354 [2024-10-12 16:27:04,429 INFO L226 Difference]: Without dead ends: 92968 [2024-10-12 16:27:04,470 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-12 16:27:04,471 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 408 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:04,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 360 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:27:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92968 states. [2024-10-12 16:27:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92968 to 88270. [2024-10-12 16:27:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88270 states, 88269 states have (on average 1.104929250359696) internal successors, (97531), 88269 states have internal predecessors, (97531), 0 states have call successors, (0), 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-12 16:27:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88270 states to 88270 states and 97531 transitions. [2024-10-12 16:27:05,749 INFO L78 Accepts]: Start accepts. Automaton has 88270 states and 97531 transitions. Word has length 398 [2024-10-12 16:27:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:05,750 INFO L471 AbstractCegarLoop]: Abstraction has 88270 states and 97531 transitions. [2024-10-12 16:27:05,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-12 16:27:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 88270 states and 97531 transitions. [2024-10-12 16:27:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-12 16:27:05,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:05,758 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:05,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:27:05,758 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -881765910, now seen corresponding path program 1 times [2024-10-12 16:27:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:05,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318432331] [2024-10-12 16:27:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-12 16:27:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318432331] [2024-10-12 16:27:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318432331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493533925] [2024-10-12 16:27:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:05,964 INFO L87 Difference]: Start difference. First operand 88270 states and 97531 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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-12 16:27:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:07,884 INFO L93 Difference]: Finished difference Result 185044 states and 204009 transitions. [2024-10-12 16:27:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 402 [2024-10-12 16:27:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:08,006 INFO L225 Difference]: With dead ends: 185044 [2024-10-12 16:27:08,006 INFO L226 Difference]: Without dead ends: 96774 [2024-10-12 16:27:08,066 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-12 16:27:08,067 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 387 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:08,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 313 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:27:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96774 states. [2024-10-12 16:27:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96774 to 91668. [2024-10-12 16:27:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91668 states, 91667 states have (on average 1.1009087239682764) internal successors, (100917), 91667 states have internal predecessors, (100917), 0 states have call successors, (0), 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-12 16:27:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91668 states to 91668 states and 100917 transitions. [2024-10-12 16:27:09,309 INFO L78 Accepts]: Start accepts. Automaton has 91668 states and 100917 transitions. Word has length 402 [2024-10-12 16:27:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:09,309 INFO L471 AbstractCegarLoop]: Abstraction has 91668 states and 100917 transitions. [2024-10-12 16:27:09,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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-12 16:27:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 91668 states and 100917 transitions. [2024-10-12 16:27:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-12 16:27:09,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:09,318 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:09,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:27:09,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:09,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash -867810567, now seen corresponding path program 1 times [2024-10-12 16:27:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341026185] [2024-10-12 16:27:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:27:10,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:10,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341026185] [2024-10-12 16:27:10,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341026185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:27:10,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033751506] [2024-10-12 16:27:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:27:10,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:27:10,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:27:10,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 16:27:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:10,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 16:27:10,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:27:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-12 16:27:11,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:27:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-12 16:27:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033751506] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:27:12,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:27:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-12 16:27:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889021977] [2024-10-12 16:27:12,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:27:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 16:27:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 16:27:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:27:12,167 INFO L87 Difference]: Start difference. First operand 91668 states and 100917 transitions. Second operand has 9 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 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-12 16:27:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:24,404 INFO L93 Difference]: Finished difference Result 231448 states and 253506 transitions. [2024-10-12 16:27:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 16:27:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 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 432 [2024-10-12 16:27:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:24,558 INFO L225 Difference]: With dead ends: 231448 [2024-10-12 16:27:24,558 INFO L226 Difference]: Without dead ends: 134673 [2024-10-12 16:27:24,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-10-12 16:27:24,587 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 11857 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 12691 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11857 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 12691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:24,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11857 Valid, 404 Invalid, 15961 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3270 Valid, 12691 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-10-12 16:27:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2024-10-12 16:27:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 109931. [2024-10-12 16:27:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109931 states, 109930 states have (on average 1.0795051396343127) internal successors, (118670), 109930 states have internal predecessors, (118670), 0 states have call successors, (0), 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-12 16:27:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109931 states to 109931 states and 118670 transitions. [2024-10-12 16:27:26,328 INFO L78 Accepts]: Start accepts. Automaton has 109931 states and 118670 transitions. Word has length 432 [2024-10-12 16:27:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:26,328 INFO L471 AbstractCegarLoop]: Abstraction has 109931 states and 118670 transitions. [2024-10-12 16:27:26,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 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-12 16:27:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 109931 states and 118670 transitions. [2024-10-12 16:27:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-10-12 16:27:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:26,337 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:27:26,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 16:27:26,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:27:26,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:26,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -166154200, now seen corresponding path program 1 times [2024-10-12 16:27:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:26,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320423437] [2024-10-12 16:27:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat