./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_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label22.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4813005008457a5d4e6ae5277d71ca9796b28c553541eb8e67cfaf33286f04c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:46:16,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:46:16,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:46:16,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:46:16,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:46:16,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:46:16,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:46:16,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:46:16,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:46:16,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:46:16,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:46:16,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:46:16,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:46:16,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:46:16,529 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:46:16,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:46:16,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:46:16,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:46:16,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:46:16,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:46:16,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:46:16,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:46:16,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:46:16,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:46:16,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:46:16,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:46:16,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:46:16,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:46:16,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:46:16,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:46:16,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:46:16,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:46:16,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:16,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:46:16,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:46:16,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:46:16,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:46:16,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:46:16,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:46:16,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:46:16,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:46:16,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:46:16,549 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4813005008457a5d4e6ae5277d71ca9796b28c553541eb8e67cfaf33286f04c4 [2024-10-10 23:46:16,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:46:16,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:46:16,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:46:16,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:46:16,828 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:46:16,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label22.c [2024-10-10 23:46:18,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:46:18,702 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:46:18,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label22.c [2024-10-10 23:46:18,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ee57c6c3a/f515ce852c5941b4a2c3c26aa1044af9/FLAG1d56912ba [2024-10-10 23:46:18,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ee57c6c3a/f515ce852c5941b4a2c3c26aa1044af9 [2024-10-10 23:46:18,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:46:18,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:46:18,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:18,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:46:18,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:46:18,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:18" (1/1) ... [2024-10-10 23:46:18,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4419cf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:18, skipping insertion in model container [2024-10-10 23:46:18,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:18" (1/1) ... [2024-10-10 23:46:18,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:46:19,128 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_label22.c[7589,7602] [2024-10-10 23:46:19,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:19,743 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:46:19,776 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_label22.c[7589,7602] [2024-10-10 23:46:20,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:20,044 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:46:20,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20 WrapperNode [2024-10-10 23:46:20,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:20,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:20,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:46:20,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:46:20,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,380 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:46:20,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:20,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:46:20,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:46:20,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:46:20,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,611 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:46:20,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:46:20,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:46:20,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:46:20,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:46:20,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (1/1) ... [2024-10-10 23:46:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:20,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:20,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:46:20,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:46:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:46:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:46:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:46:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:46:21,029 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:46:21,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:46:24,305 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:46:24,306 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:46:24,364 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:46:24,365 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:46:24,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:24 BoogieIcfgContainer [2024-10-10 23:46:24,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:46:24,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:46:24,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:46:24,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:46:24,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:46:18" (1/3) ... [2024-10-10 23:46:24,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5734efcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:24, skipping insertion in model container [2024-10-10 23:46:24,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:20" (2/3) ... [2024-10-10 23:46:24,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5734efcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:24, skipping insertion in model container [2024-10-10 23:46:24,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:24" (3/3) ... [2024-10-10 23:46:24,377 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label22.c [2024-10-10 23:46:24,393 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:46:24,393 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:46:24,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:46:24,494 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;@21154589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:46:24,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:46:24,501 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-10 23:46:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-10 23:46:24,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:24,514 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] [2024-10-10 23:46:24,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:24,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1255789717, now seen corresponding path program 1 times [2024-10-10 23:46:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:24,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068893163] [2024-10-10 23:46:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068893163] [2024-10-10 23:46:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068893163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:24,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821813851] [2024-10-10 23:46:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:46:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:46:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:24,770 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:24,857 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:46:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:46:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-10 23:46:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:24,875 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:46:24,875 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:46:24,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:24,883 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-10 23:46:24,884 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-10 23:46:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:46:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:46:24,965 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-10 23:46:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:46:24,971 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 50 [2024-10-10 23:46:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:24,972 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:46:24,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:46:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-10 23:46:24,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:24,974 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] [2024-10-10 23:46:24,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:46:24,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:24,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1156969977, now seen corresponding path program 1 times [2024-10-10 23:46:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028943513] [2024-10-10 23:46:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028943513] [2024-10-10 23:46:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028943513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511962669] [2024-10-10 23:46:25,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:25,270 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:27,694 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-10 23:46:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-10 23:46:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:27,700 INFO L225 Difference]: With dead ends: 1522 [2024-10-10 23:46:27,701 INFO L226 Difference]: Without dead ends: 997 [2024-10-10 23:46:27,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:27,704 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 460 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:27,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-10 23:46:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-10 23:46:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-10 23:46:27,744 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 50 [2024-10-10 23:46:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:27,744 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-10 23:46:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-10 23:46:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:46:27,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:27,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:46:27,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 132996429, now seen corresponding path program 1 times [2024-10-10 23:46:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053699058] [2024-10-10 23:46:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:28,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053699058] [2024-10-10 23:46:28,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053699058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:28,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828306119] [2024-10-10 23:46:28,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:28,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:28,010 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:30,200 INFO L93 Difference]: Finished difference Result 2840 states and 4880 transitions. [2024-10-10 23:46:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-10 23:46:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:30,208 INFO L225 Difference]: With dead ends: 2840 [2024-10-10 23:46:30,208 INFO L226 Difference]: Without dead ends: 1860 [2024-10-10 23:46:30,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:30,215 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:30,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 494 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-10-10 23:46:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1856. [2024-10-10 23:46:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4549865229110512) internal successors, (2699), 1855 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2699 transitions. [2024-10-10 23:46:30,261 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2699 transitions. Word has length 115 [2024-10-10 23:46:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2699 transitions. [2024-10-10 23:46:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2699 transitions. [2024-10-10 23:46:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-10 23:46:30,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:30,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:46:30,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:30,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 513240376, now seen corresponding path program 1 times [2024-10-10 23:46:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:30,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096058160] [2024-10-10 23:46:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096058160] [2024-10-10 23:46:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096058160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659167605] [2024-10-10 23:46:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:30,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:30,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:30,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:30,777 INFO L87 Difference]: Start difference. First operand 1856 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:33,148 INFO L93 Difference]: Finished difference Result 4590 states and 6639 transitions. [2024-10-10 23:46:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:33,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-10 23:46:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:33,158 INFO L225 Difference]: With dead ends: 4590 [2024-10-10 23:46:33,159 INFO L226 Difference]: Without dead ends: 2735 [2024-10-10 23:46:33,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:33,162 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:33,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 535 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-10 23:46:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2715. [2024-10-10 23:46:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.3909358879882092) internal successors, (3775), 2714 states have internal predecessors, (3775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3775 transitions. [2024-10-10 23:46:33,209 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3775 transitions. Word has length 155 [2024-10-10 23:46:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:33,210 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3775 transitions. [2024-10-10 23:46:33,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3775 transitions. [2024-10-10 23:46:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-10 23:46:33,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:33,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:33,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:46:33,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -138781177, now seen corresponding path program 1 times [2024-10-10 23:46:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353441885] [2024-10-10 23:46:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353441885] [2024-10-10 23:46:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353441885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:33,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:33,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564079657] [2024-10-10 23:46:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:33,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:33,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:33,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:33,427 INFO L87 Difference]: Start difference. First operand 2715 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:35,183 INFO L93 Difference]: Finished difference Result 6708 states and 9428 transitions. [2024-10-10 23:46:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:35,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-10 23:46:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:35,197 INFO L225 Difference]: With dead ends: 6708 [2024-10-10 23:46:35,198 INFO L226 Difference]: Without dead ends: 3994 [2024-10-10 23:46:35,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:35,202 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 589 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.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:35,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:46:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2024-10-10 23:46:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3141. [2024-10-10 23:46:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.2745222929936306) internal successors, (4002), 3140 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4002 transitions. [2024-10-10 23:46:35,254 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4002 transitions. Word has length 161 [2024-10-10 23:46:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:35,255 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4002 transitions. [2024-10-10 23:46:35,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4002 transitions. [2024-10-10 23:46:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 23:46:35,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:35,258 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, 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] [2024-10-10 23:46:35,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:46:35,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:35,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:35,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1589572620, now seen corresponding path program 1 times [2024-10-10 23:46:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:35,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744607902] [2024-10-10 23:46:35,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744607902] [2024-10-10 23:46:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744607902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:35,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 23:46:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768589029] [2024-10-10 23:46:35,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:35,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:46:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:46:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:46:35,652 INFO L87 Difference]: Start difference. First operand 3141 states and 4002 transitions. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:38,147 INFO L93 Difference]: Finished difference Result 8004 states and 10507 transitions. [2024-10-10 23:46:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2024-10-10 23:46:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:38,164 INFO L225 Difference]: With dead ends: 8004 [2024-10-10 23:46:38,164 INFO L226 Difference]: Without dead ends: 4864 [2024-10-10 23:46:38,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:46:38,171 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 593 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:38,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 924 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:46:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2024-10-10 23:46:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4851. [2024-10-10 23:46:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4850 states have (on average 1.26659793814433) internal successors, (6143), 4850 states have internal predecessors, (6143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6143 transitions. [2024-10-10 23:46:38,255 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 6143 transitions. Word has length 198 [2024-10-10 23:46:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:38,256 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 6143 transitions. [2024-10-10 23:46:38,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 6143 transitions. [2024-10-10 23:46:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-10 23:46:38,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:38,259 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, 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] [2024-10-10 23:46:38,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:46:38,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:38,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2115883771, now seen corresponding path program 1 times [2024-10-10 23:46:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591651761] [2024-10-10 23:46:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:46:38,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591651761] [2024-10-10 23:46:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591651761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849890194] [2024-10-10 23:46:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:38,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:38,448 INFO L87 Difference]: Start difference. First operand 4851 states and 6143 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:40,596 INFO L93 Difference]: Finished difference Result 12248 states and 15824 transitions. [2024-10-10 23:46:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:40,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 204 [2024-10-10 23:46:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:40,618 INFO L225 Difference]: With dead ends: 12248 [2024-10-10 23:46:40,618 INFO L226 Difference]: Without dead ends: 7398 [2024-10-10 23:46:40,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:40,627 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 396 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:40,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 543 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2024-10-10 23:46:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 4825. [2024-10-10 23:46:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4824 states have (on average 1.265339966832504) internal successors, (6104), 4824 states have internal predecessors, (6104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6104 transitions. [2024-10-10 23:46:40,724 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6104 transitions. Word has length 204 [2024-10-10 23:46:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6104 transitions. [2024-10-10 23:46:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6104 transitions. [2024-10-10 23:46:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-10 23:46:40,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:40,728 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:46:40,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1042697993, now seen corresponding path program 1 times [2024-10-10 23:46:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958538321] [2024-10-10 23:46:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 75 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958538321] [2024-10-10 23:46:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958538321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433600987] [2024-10-10 23:46:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:41,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:41,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:41,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:41,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:46:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:41,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:46:41,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:41,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:46:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433600987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:46:41,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:46:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360177907] [2024-10-10 23:46:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:41,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:41,409 INFO L87 Difference]: Start difference. First operand 4825 states and 6104 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:43,409 INFO L93 Difference]: Finished difference Result 13480 states and 17130 transitions. [2024-10-10 23:46:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:43,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 217 [2024-10-10 23:46:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:43,433 INFO L225 Difference]: With dead ends: 13480 [2024-10-10 23:46:43,434 INFO L226 Difference]: Without dead ends: 8656 [2024-10-10 23:46:43,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:43,442 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 432 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:43,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 481 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:46:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2024-10-10 23:46:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 7377. [2024-10-10 23:46:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7377 states, 7376 states have (on average 1.247966377440347) internal successors, (9205), 7376 states have internal predecessors, (9205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9205 transitions. [2024-10-10 23:46:43,570 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9205 transitions. Word has length 217 [2024-10-10 23:46:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 7377 states and 9205 transitions. [2024-10-10 23:46:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9205 transitions. [2024-10-10 23:46:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-10 23:46:43,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:43,575 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:43,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:46:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:43,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1292040107, now seen corresponding path program 1 times [2024-10-10 23:46:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946123721] [2024-10-10 23:46:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946123721] [2024-10-10 23:46:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946123721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:44,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944864941] [2024-10-10 23:46:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:44,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:44,076 INFO L87 Difference]: Start difference. First operand 7377 states and 9205 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:46,236 INFO L93 Difference]: Finished difference Result 18606 states and 23434 transitions. [2024-10-10 23:46:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 266 [2024-10-10 23:46:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:46,255 INFO L225 Difference]: With dead ends: 18606 [2024-10-10 23:46:46,255 INFO L226 Difference]: Without dead ends: 10378 [2024-10-10 23:46:46,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:46,266 INFO L432 NwaCegarLoop]: 943 mSDtfsCounter, 449 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:46,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1017 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2024-10-10 23:46:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10370. [2024-10-10 23:46:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10370 states, 10369 states have (on average 1.2060950911370432) internal successors, (12506), 10369 states have internal predecessors, (12506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10370 states to 10370 states and 12506 transitions. [2024-10-10 23:46:46,410 INFO L78 Accepts]: Start accepts. Automaton has 10370 states and 12506 transitions. Word has length 266 [2024-10-10 23:46:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:46,410 INFO L471 AbstractCegarLoop]: Abstraction has 10370 states and 12506 transitions. [2024-10-10 23:46:46,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10370 states and 12506 transitions. [2024-10-10 23:46:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-10 23:46:46,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:46,418 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, 3, 3, 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-10 23:46:46,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:46:46,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:46,418 INFO L85 PathProgramCache]: Analyzing trace with hash -225339026, now seen corresponding path program 1 times [2024-10-10 23:46:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683154364] [2024-10-10 23:46:46,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-10 23:46:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683154364] [2024-10-10 23:46:46,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683154364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071822939] [2024-10-10 23:46:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:46,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:46,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:46,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:46,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:46:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:47,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:46:47,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-10 23:46:47,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-10 23:46:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071822939] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:47,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:46:47,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:46:47,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117223192] [2024-10-10 23:46:47,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:47,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:47,561 INFO L87 Difference]: Start difference. First operand 10370 states and 12506 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-10 23:46:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:50,475 INFO L93 Difference]: Finished difference Result 32690 states and 39750 transitions. [2024-10-10 23:46:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:50,476 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 274 [2024-10-10 23:46:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:50,508 INFO L225 Difference]: With dead ends: 32690 [2024-10-10 23:46:50,509 INFO L226 Difference]: Without dead ends: 21460 [2024-10-10 23:46:50,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 545 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-10 23:46:50,526 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 903 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:50,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 155 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [852 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:46:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21460 states. [2024-10-10 23:46:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21460 to 21458. [2024-10-10 23:46:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21458 states, 21457 states have (on average 1.1587826816423545) internal successors, (24864), 21457 states have internal predecessors, (24864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21458 states to 21458 states and 24864 transitions. [2024-10-10 23:46:50,914 INFO L78 Accepts]: Start accepts. Automaton has 21458 states and 24864 transitions. Word has length 274 [2024-10-10 23:46:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:50,914 INFO L471 AbstractCegarLoop]: Abstraction has 21458 states and 24864 transitions. [2024-10-10 23:46:50,914 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-10 23:46:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21458 states and 24864 transitions. [2024-10-10 23:46:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-10-10 23:46:50,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:50,920 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:50,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:46:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:51,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 898150666, now seen corresponding path program 1 times [2024-10-10 23:46:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:51,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651080595] [2024-10-10 23:46:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:46:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651080595] [2024-10-10 23:46:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651080595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310421140] [2024-10-10 23:46:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:51,306 INFO L87 Difference]: Start difference. First operand 21458 states and 24864 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:52,848 INFO L93 Difference]: Finished difference Result 47591 states and 55278 transitions. [2024-10-10 23:46:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2024-10-10 23:46:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:52,897 INFO L225 Difference]: With dead ends: 47591 [2024-10-10 23:46:52,897 INFO L226 Difference]: Without dead ends: 25707 [2024-10-10 23:46:53,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:53,068 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 371 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:53,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 857 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2024-10-10 23:46:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2024-10-10 23:46:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25707 states, 25706 states have (on average 1.1349101377110402) internal successors, (29174), 25706 states have internal predecessors, (29174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 29174 transitions. [2024-10-10 23:46:53,448 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 29174 transitions. Word has length 287 [2024-10-10 23:46:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:53,449 INFO L471 AbstractCegarLoop]: Abstraction has 25707 states and 29174 transitions. [2024-10-10 23:46:53,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 29174 transitions. [2024-10-10 23:46:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:46:53,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:53,461 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, 4, 4, 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-10 23:46:53,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:46:53,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:53,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1314930607, now seen corresponding path program 1 times [2024-10-10 23:46:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:53,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450521572] [2024-10-10 23:46:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 377 proven. 73 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-10 23:46:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450521572] [2024-10-10 23:46:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450521572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399362020] [2024-10-10 23:46:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:53,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:53,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:53,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:53,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:46:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:54,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:46:54,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 377 proven. 73 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-10 23:46:54,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-10 23:46:54,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399362020] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:54,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:46:54,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:46:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882656722] [2024-10-10 23:46:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:54,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:54,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:54,512 INFO L87 Difference]: Start difference. First operand 25707 states and 29174 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-10 23:46:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:57,034 INFO L93 Difference]: Finished difference Result 62498 states and 71198 transitions. [2024-10-10 23:46:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:57,034 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 348 [2024-10-10 23:46:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:57,093 INFO L225 Difference]: With dead ends: 62498 [2024-10-10 23:46:57,093 INFO L226 Difference]: Without dead ends: 36365 [2024-10-10 23:46:57,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 693 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-10 23:46:57,120 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 842 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:57,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 192 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36365 states. [2024-10-10 23:46:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36365 to 34237. [2024-10-10 23:46:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34237 states, 34236 states have (on average 1.1454609183315807) internal successors, (39216), 34236 states have internal predecessors, (39216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34237 states to 34237 states and 39216 transitions. [2024-10-10 23:46:57,563 INFO L78 Accepts]: Start accepts. Automaton has 34237 states and 39216 transitions. Word has length 348 [2024-10-10 23:46:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:57,564 INFO L471 AbstractCegarLoop]: Abstraction has 34237 states and 39216 transitions. [2024-10-10 23:46:57,564 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-10 23:46:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 34237 states and 39216 transitions. [2024-10-10 23:46:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-10 23:46:57,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:57,579 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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:57,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:46:57,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:57,780 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:57,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:57,781 INFO L85 PathProgramCache]: Analyzing trace with hash 257958992, now seen corresponding path program 1 times [2024-10-10 23:46:57,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:57,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114167788] [2024-10-10 23:46:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-10 23:46:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:58,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114167788] [2024-10-10 23:46:58,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114167788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:58,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:58,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039143363] [2024-10-10 23:46:58,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:58,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:58,134 INFO L87 Difference]: Start difference. First operand 34237 states and 39216 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:59,761 INFO L93 Difference]: Finished difference Result 80387 states and 92353 transitions. [2024-10-10 23:46:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 471 [2024-10-10 23:46:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:59,824 INFO L225 Difference]: With dead ends: 80387 [2024-10-10 23:46:59,825 INFO L226 Difference]: Without dead ends: 45724 [2024-10-10 23:46:59,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:59,860 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 485 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:59,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 253 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45724 states. [2024-10-10 23:47:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45724 to 33770. [2024-10-10 23:47:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33770 states, 33769 states have (on average 1.1432971068139417) internal successors, (38608), 33769 states have internal predecessors, (38608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33770 states to 33770 states and 38608 transitions. [2024-10-10 23:47:00,437 INFO L78 Accepts]: Start accepts. Automaton has 33770 states and 38608 transitions. Word has length 471 [2024-10-10 23:47:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:00,438 INFO L471 AbstractCegarLoop]: Abstraction has 33770 states and 38608 transitions. [2024-10-10 23:47:00,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 33770 states and 38608 transitions. [2024-10-10 23:47:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-10 23:47:00,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:00,453 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:00,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:47:00,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1230681176, now seen corresponding path program 1 times [2024-10-10 23:47:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168396446] [2024-10-10 23:47:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-10 23:47:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168396446] [2024-10-10 23:47:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168396446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:00,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:00,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334575296] [2024-10-10 23:47:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:00,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:00,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:00,817 INFO L87 Difference]: Start difference. First operand 33770 states and 38608 transitions. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:02,575 INFO L93 Difference]: Finished difference Result 80765 states and 92382 transitions. [2024-10-10 23:47:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:02,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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 483 [2024-10-10 23:47:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:02,624 INFO L225 Difference]: With dead ends: 80765 [2024-10-10 23:47:02,625 INFO L226 Difference]: Without dead ends: 43594 [2024-10-10 23:47:02,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:02,648 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 372 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:02,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 843 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:47:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2024-10-10 23:47:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 38897. [2024-10-10 23:47:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38897 states, 38896 states have (on average 1.118264088852324) internal successors, (43496), 38896 states have internal predecessors, (43496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38897 states to 38897 states and 43496 transitions. [2024-10-10 23:47:03,167 INFO L78 Accepts]: Start accepts. Automaton has 38897 states and 43496 transitions. Word has length 483 [2024-10-10 23:47:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:03,168 INFO L471 AbstractCegarLoop]: Abstraction has 38897 states and 43496 transitions. [2024-10-10 23:47:03,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38897 states and 43496 transitions. [2024-10-10 23:47:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-10 23:47:03,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:03,188 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:47:03,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:03,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -431960701, now seen corresponding path program 1 times [2024-10-10 23:47:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177919948] [2024-10-10 23:47:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:47:03,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177919948] [2024-10-10 23:47:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177919948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030276401] [2024-10-10 23:47:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:03,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:03,734 INFO L87 Difference]: Start difference. First operand 38897 states and 43496 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:05,303 INFO L93 Difference]: Finished difference Result 90993 states and 101593 transitions. [2024-10-10 23:47:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 485 [2024-10-10 23:47:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:05,358 INFO L225 Difference]: With dead ends: 90993 [2024-10-10 23:47:05,359 INFO L226 Difference]: Without dead ends: 51665 [2024-10-10 23:47:05,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:05,386 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 471 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:05,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 163 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:47:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51665 states. [2024-10-10 23:47:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51665 to 49094. [2024-10-10 23:47:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49094 states, 49093 states have (on average 1.117104271484733) internal successors, (54842), 49093 states have internal predecessors, (54842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49094 states to 49094 states and 54842 transitions. [2024-10-10 23:47:05,951 INFO L78 Accepts]: Start accepts. Automaton has 49094 states and 54842 transitions. Word has length 485 [2024-10-10 23:47:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:05,952 INFO L471 AbstractCegarLoop]: Abstraction has 49094 states and 54842 transitions. [2024-10-10 23:47:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 49094 states and 54842 transitions. [2024-10-10 23:47:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-10 23:47:05,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:05,964 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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:05,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:47:05,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:05,966 INFO L85 PathProgramCache]: Analyzing trace with hash -63649556, now seen corresponding path program 1 times [2024-10-10 23:47:05,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:05,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150213708] [2024-10-10 23:47:05,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:05,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:47:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150213708] [2024-10-10 23:47:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150213708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:06,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:06,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691152369] [2024-10-10 23:47:06,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:06,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:06,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:06,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:06,525 INFO L87 Difference]: Start difference. First operand 49094 states and 54842 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:08,040 INFO L93 Difference]: Finished difference Result 111374 states and 124282 transitions. [2024-10-10 23:47:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 493 [2024-10-10 23:47:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:08,116 INFO L225 Difference]: With dead ends: 111374 [2024-10-10 23:47:08,117 INFO L226 Difference]: Without dead ends: 57604 [2024-10-10 23:47:08,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:08,155 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 280 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:08,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 775 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:47:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57604 states. [2024-10-10 23:47:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57604 to 45662. [2024-10-10 23:47:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45662 states, 45661 states have (on average 1.1177810385230285) internal successors, (51039), 45661 states have internal predecessors, (51039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45662 states to 45662 states and 51039 transitions. [2024-10-10 23:47:09,058 INFO L78 Accepts]: Start accepts. Automaton has 45662 states and 51039 transitions. Word has length 493 [2024-10-10 23:47:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:09,058 INFO L471 AbstractCegarLoop]: Abstraction has 45662 states and 51039 transitions. [2024-10-10 23:47:09,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 45662 states and 51039 transitions. [2024-10-10 23:47:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-10-10 23:47:09,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:09,076 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:09,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:47:09,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:09,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 97402296, now seen corresponding path program 1 times [2024-10-10 23:47:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:09,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301949761] [2024-10-10 23:47:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-10 23:47:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301949761] [2024-10-10 23:47:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301949761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:09,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:09,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667353792] [2024-10-10 23:47:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:09,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:09,530 INFO L87 Difference]: Start difference. First operand 45662 states and 51039 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:11,165 INFO L93 Difference]: Finished difference Result 100252 states and 111803 transitions. [2024-10-10 23:47:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 593 [2024-10-10 23:47:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:11,228 INFO L225 Difference]: With dead ends: 100252 [2024-10-10 23:47:11,228 INFO L226 Difference]: Without dead ends: 50757 [2024-10-10 23:47:11,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:11,249 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 493 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:11,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 700 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50757 states. [2024-10-10 23:47:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50757 to 49053. [2024-10-10 23:47:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49053 states, 49052 states have (on average 1.105031395254016) internal successors, (54204), 49052 states have internal predecessors, (54204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49053 states to 49053 states and 54204 transitions. [2024-10-10 23:47:11,903 INFO L78 Accepts]: Start accepts. Automaton has 49053 states and 54204 transitions. Word has length 593 [2024-10-10 23:47:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:11,904 INFO L471 AbstractCegarLoop]: Abstraction has 49053 states and 54204 transitions. [2024-10-10 23:47:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 49053 states and 54204 transitions. [2024-10-10 23:47:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2024-10-10 23:47:11,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:11,925 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:47:11,925 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash -443582747, now seen corresponding path program 1 times [2024-10-10 23:47:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:11,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632811895] [2024-10-10 23:47:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:47:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632811895] [2024-10-10 23:47:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632811895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668723068] [2024-10-10 23:47:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:13,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:13,069 INFO L87 Difference]: Start difference. First operand 49053 states and 54204 transitions. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:14,324 INFO L93 Difference]: Finished difference Result 98104 states and 108406 transitions. [2024-10-10 23:47:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 617 [2024-10-10 23:47:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:14,376 INFO L225 Difference]: With dead ends: 98104 [2024-10-10 23:47:14,377 INFO L226 Difference]: Without dead ends: 49052 [2024-10-10 23:47:14,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:14,402 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 573 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:14,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 544 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:47:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49052 states. [2024-10-10 23:47:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49052 to 49052. [2024-10-10 23:47:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49052 states, 49051 states have (on average 1.104870440969603) internal successors, (54195), 49051 states have internal predecessors, (54195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49052 states to 49052 states and 54195 transitions. [2024-10-10 23:47:15,186 INFO L78 Accepts]: Start accepts. Automaton has 49052 states and 54195 transitions. Word has length 617 [2024-10-10 23:47:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:15,187 INFO L471 AbstractCegarLoop]: Abstraction has 49052 states and 54195 transitions. [2024-10-10 23:47:15,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 49052 states and 54195 transitions. [2024-10-10 23:47:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2024-10-10 23:47:15,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:15,227 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:47:15,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1374365083, now seen corresponding path program 1 times [2024-10-10 23:47:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:15,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156277235] [2024-10-10 23:47:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-10-10 23:47:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156277235] [2024-10-10 23:47:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156277235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:15,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565942387] [2024-10-10 23:47:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:15,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:15,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:15,768 INFO L87 Difference]: Start difference. First operand 49052 states and 54195 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:17,289 INFO L93 Difference]: Finished difference Result 105754 states and 116620 transitions. [2024-10-10 23:47:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 702 [2024-10-10 23:47:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:17,348 INFO L225 Difference]: With dead ends: 105754 [2024-10-10 23:47:17,348 INFO L226 Difference]: Without dead ends: 56274 [2024-10-10 23:47:17,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:17,365 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 427 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:17,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 284 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:47:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56274 states. [2024-10-10 23:47:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56274 to 52019. [2024-10-10 23:47:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52019 states, 52018 states have (on average 1.0968703141220346) internal successors, (57057), 52018 states have internal predecessors, (57057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52019 states to 52019 states and 57057 transitions. [2024-10-10 23:47:17,895 INFO L78 Accepts]: Start accepts. Automaton has 52019 states and 57057 transitions. Word has length 702 [2024-10-10 23:47:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:17,896 INFO L471 AbstractCegarLoop]: Abstraction has 52019 states and 57057 transitions. [2024-10-10 23:47:17,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52019 states and 57057 transitions. [2024-10-10 23:47:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2024-10-10 23:47:17,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:17,922 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:17,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:47:17,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:17,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash 192316438, now seen corresponding path program 1 times [2024-10-10 23:47:17,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:17,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132151671] [2024-10-10 23:47:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 523 proven. 189 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:47:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132151671] [2024-10-10 23:47:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132151671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:47:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944067653] [2024-10-10 23:47:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:47:19,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:19,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:47:19,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:47:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:19,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:47:19,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:47:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 523 proven. 189 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:47:20,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:47:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 523 proven. 189 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:47:21,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944067653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:47:21,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:47:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 23:47:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141963800] [2024-10-10 23:47:21,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:47:21,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:47:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:47:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:47:21,780 INFO L87 Difference]: Start difference. First operand 52019 states and 57057 transitions. Second operand has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:25,221 INFO L93 Difference]: Finished difference Result 111712 states and 122488 transitions. [2024-10-10 23:47:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:47:25,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 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 806 [2024-10-10 23:47:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:25,288 INFO L225 Difference]: With dead ends: 111712 [2024-10-10 23:47:25,288 INFO L226 Difference]: Without dead ends: 59266 [2024-10-10 23:47:25,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1616 GetRequests, 1610 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:47:25,325 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 837 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4379 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 4379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:25,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 846 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 4379 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:47:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59266 states. [2024-10-10 23:47:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59266 to 52443. [2024-10-10 23:47:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52443 states, 52442 states have (on average 1.0909766980664353) internal successors, (57213), 52442 states have internal predecessors, (57213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52443 states to 52443 states and 57213 transitions. [2024-10-10 23:47:25,949 INFO L78 Accepts]: Start accepts. Automaton has 52443 states and 57213 transitions. Word has length 806 [2024-10-10 23:47:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:25,949 INFO L471 AbstractCegarLoop]: Abstraction has 52443 states and 57213 transitions. [2024-10-10 23:47:25,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 52443 states and 57213 transitions. [2024-10-10 23:47:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2024-10-10 23:47:25,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:25,983 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:26,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:47:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:47:26,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1660624231, now seen corresponding path program 1 times [2024-10-10 23:47:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705098162] [2024-10-10 23:47:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2024-10-10 23:47:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705098162] [2024-10-10 23:47:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705098162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891780543] [2024-10-10 23:47:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:26,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:26,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:26,803 INFO L87 Difference]: Start difference. First operand 52443 states and 57213 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:28,388 INFO L93 Difference]: Finished difference Result 111247 states and 120834 transitions. [2024-10-10 23:47:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:28,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 815 [2024-10-10 23:47:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:28,464 INFO L225 Difference]: With dead ends: 111247 [2024-10-10 23:47:28,464 INFO L226 Difference]: Without dead ends: 55829 [2024-10-10 23:47:28,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:28,501 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 449 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:28,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 706 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55829 states. [2024-10-10 23:47:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55829 to 53701. [2024-10-10 23:47:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53701 states, 53700 states have (on average 1.0778212290502793) internal successors, (57879), 53700 states have internal predecessors, (57879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53701 states to 53701 states and 57879 transitions. [2024-10-10 23:47:29,300 INFO L78 Accepts]: Start accepts. Automaton has 53701 states and 57879 transitions. Word has length 815 [2024-10-10 23:47:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:29,301 INFO L471 AbstractCegarLoop]: Abstraction has 53701 states and 57879 transitions. [2024-10-10 23:47:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 53701 states and 57879 transitions. [2024-10-10 23:47:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2024-10-10 23:47:29,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:29,327 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:29,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:47:29,328 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2106022133, now seen corresponding path program 1 times [2024-10-10 23:47:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824764717] [2024-10-10 23:47:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 1025 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-10 23:47:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824764717] [2024-10-10 23:47:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824764717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437251797] [2024-10-10 23:47:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:30,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:30,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:30,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:30,158 INFO L87 Difference]: Start difference. First operand 53701 states and 57879 transitions. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)