./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/Problem03_label42.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/Problem03_label42.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 43b1e2ddb5478e4d8ee38477d15f5851a49b7cf223d0a089a3fdb9014fd7706f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:38:25,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:38:25,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:38:25,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:38:25,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:38:25,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:38:25,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:38:25,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:38:25,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:38:25,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:38:25,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:38:25,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:38:25,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:38:25,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:38:25,437 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:38:25,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:38:25,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:38:25,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:38:25,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:38:25,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:38:25,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:38:25,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:38:25,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:38:25,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:38:25,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:38:25,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:38:25,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:38:25,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:38:25,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:38:25,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:38:25,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:38:25,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:38:25,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:38:25,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:38:25,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:38:25,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:38:25,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:38:25,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:38:25,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:38:25,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:38:25,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:38:25,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:38:25,451 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 -> 43b1e2ddb5478e4d8ee38477d15f5851a49b7cf223d0a089a3fdb9014fd7706f [2024-10-10 22:38:25,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:38:25,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:38:25,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:38:25,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:38:25,745 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:38:25,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2024-10-10 22:38:27,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:38:27,617 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:38:27,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2024-10-10 22:38:27,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4791681d5/24787c3dafa243eb948d0eb5828a535a/FLAGcffc6ec5a [2024-10-10 22:38:27,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4791681d5/24787c3dafa243eb948d0eb5828a535a [2024-10-10 22:38:27,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:38:27,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:38:27,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:38:27,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:38:27,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:38:27,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:38:27" (1/1) ... [2024-10-10 22:38:27,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c095f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:27, skipping insertion in model container [2024-10-10 22:38:27,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:38:27" (1/1) ... [2024-10-10 22:38:27,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:38:28,292 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/Problem03_label42.c[60691,60704] [2024-10-10 22:38:28,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:38:28,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:38:28,582 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/Problem03_label42.c[60691,60704] [2024-10-10 22:38:28,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:38:28,612 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:38:28,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28 WrapperNode [2024-10-10 22:38:28,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:38:28,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:38:28,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:38:28,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:38:28,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,764 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:38:28,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:38:28,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:38:28,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:38:28,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:38:28,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,842 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 22:38:28,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:38:28,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:38:28,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:38:28,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:38:28,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (1/1) ... [2024-10-10 22:38:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:38:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:28,980 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 22:38:28,983 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 22:38:29,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:38:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:38:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:38:29,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:38:29,127 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:38:29,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:38:30,985 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:38:30,986 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:38:31,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:38:31,038 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:38:31,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:38:31 BoogieIcfgContainer [2024-10-10 22:38:31,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:38:31,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:38:31,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:38:31,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:38:31,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:38:27" (1/3) ... [2024-10-10 22:38:31,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef85fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:38:31, skipping insertion in model container [2024-10-10 22:38:31,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:28" (2/3) ... [2024-10-10 22:38:31,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef85fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:38:31, skipping insertion in model container [2024-10-10 22:38:31,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:38:31" (3/3) ... [2024-10-10 22:38:31,048 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label42.c [2024-10-10 22:38:31,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:38:31,066 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:38:31,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:38:31,154 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;@267494f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:38:31,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:38:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 22:38:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-10 22:38:31,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:31,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:31,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 173897473, now seen corresponding path program 1 times [2024-10-10 22:38:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:31,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921938067] [2024-10-10 22:38:31,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:31,889 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 22:38:31,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:31,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921938067] [2024-10-10 22:38:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921938067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786255873] [2024-10-10 22:38:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:31,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:38:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:38:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:38:31,939 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 22:38:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:31,989 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:38:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:38:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-10-10 22:38:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:32,007 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:38:32,007 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:38:32,013 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 22:38:32,018 INFO L432 NwaCegarLoop]: 392 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, 392 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 22:38:32,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:38:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:38:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:38:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 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 22:38:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:38:32,078 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 195 [2024-10-10 22:38:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:32,080 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:38:32,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 22:38:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:38:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-10 22:38:32,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:32,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:32,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:38:32,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 313029743, now seen corresponding path program 1 times [2024-10-10 22:38:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851033482] [2024-10-10 22:38:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:32,746 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 22:38:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851033482] [2024-10-10 22:38:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851033482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498690792] [2024-10-10 22:38:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:32,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:32,755 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 22:38:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:33,698 INFO L93 Difference]: Finished difference Result 696 states and 1149 transitions. [2024-10-10 22:38:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:33,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-10-10 22:38:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:33,704 INFO L225 Difference]: With dead ends: 696 [2024-10-10 22:38:33,704 INFO L226 Difference]: Without dead ends: 459 [2024-10-10 22:38:33,706 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 22:38:33,707 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 68 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:33,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 137 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:38:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-10 22:38:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2024-10-10 22:38:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5514223194748358) internal successors, (709), 457 states have internal predecessors, (709), 0 states have call successors, (0), 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 22:38:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 709 transitions. [2024-10-10 22:38:33,731 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 709 transitions. Word has length 195 [2024-10-10 22:38:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 709 transitions. [2024-10-10 22:38:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 22:38:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 709 transitions. [2024-10-10 22:38:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-10 22:38:33,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:33,738 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:38:33,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:38:33,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1017292123, now seen corresponding path program 1 times [2024-10-10 22:38:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349306543] [2024-10-10 22:38:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:34,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:34,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349306543] [2024-10-10 22:38:34,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349306543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:34,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:34,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885284671] [2024-10-10 22:38:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:34,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:34,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:34,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:34,036 INFO L87 Difference]: Start difference. First operand 458 states and 709 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 22:38:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:34,789 INFO L93 Difference]: Finished difference Result 1341 states and 2081 transitions. [2024-10-10 22:38:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2024-10-10 22:38:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:34,793 INFO L225 Difference]: With dead ends: 1341 [2024-10-10 22:38:34,794 INFO L226 Difference]: Without dead ends: 884 [2024-10-10 22:38:34,795 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 22:38:34,796 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:34,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 179 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:38:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-10 22:38:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 879. [2024-10-10 22:38:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.469248291571754) internal successors, (1290), 878 states have internal predecessors, (1290), 0 states have call successors, (0), 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 22:38:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1290 transitions. [2024-10-10 22:38:34,831 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1290 transitions. Word has length 200 [2024-10-10 22:38:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:34,831 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1290 transitions. [2024-10-10 22:38:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 22:38:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1290 transitions. [2024-10-10 22:38:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-10 22:38:34,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:34,836 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:38:34,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:38:34,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 78069134, now seen corresponding path program 1 times [2024-10-10 22:38:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898839003] [2024-10-10 22:38:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898839003] [2024-10-10 22:38:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898839003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:35,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189675831] [2024-10-10 22:38:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:35,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:35,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:35,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:35,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:35,008 INFO L87 Difference]: Start difference. First operand 879 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 22:38:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:35,867 INFO L93 Difference]: Finished difference Result 2593 states and 3821 transitions. [2024-10-10 22:38:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:35,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-10-10 22:38:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:35,875 INFO L225 Difference]: With dead ends: 2593 [2024-10-10 22:38:35,875 INFO L226 Difference]: Without dead ends: 1715 [2024-10-10 22:38:35,878 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 22:38:35,882 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:35,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:35,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-10 22:38:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1695. [2024-10-10 22:38:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.4386068476977567) internal successors, (2437), 1694 states have internal predecessors, (2437), 0 states have call successors, (0), 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 22:38:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2437 transitions. [2024-10-10 22:38:35,922 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2437 transitions. Word has length 203 [2024-10-10 22:38:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:35,922 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2437 transitions. [2024-10-10 22:38:35,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 22:38:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2437 transitions. [2024-10-10 22:38:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-10 22:38:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:35,928 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-10 22:38:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:38:35,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1653184181, now seen corresponding path program 1 times [2024-10-10 22:38:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294855692] [2024-10-10 22:38:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:38:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294855692] [2024-10-10 22:38:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294855692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:36,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:36,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956929574] [2024-10-10 22:38:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:36,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:36,250 INFO L87 Difference]: Start difference. First operand 1695 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 22:38:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:37,108 INFO L93 Difference]: Finished difference Result 5016 states and 7220 transitions. [2024-10-10 22:38:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 215 [2024-10-10 22:38:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:37,122 INFO L225 Difference]: With dead ends: 5016 [2024-10-10 22:38:37,122 INFO L226 Difference]: Without dead ends: 3322 [2024-10-10 22:38:37,127 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 22:38:37,129 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 234 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:37,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 409 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2024-10-10 22:38:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3319. [2024-10-10 22:38:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3319 states, 3318 states have (on average 1.2848101265822784) internal successors, (4263), 3318 states have internal predecessors, (4263), 0 states have call successors, (0), 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 22:38:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4263 transitions. [2024-10-10 22:38:37,201 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4263 transitions. Word has length 215 [2024-10-10 22:38:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:37,202 INFO L471 AbstractCegarLoop]: Abstraction has 3319 states and 4263 transitions. [2024-10-10 22:38:37,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 22:38:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4263 transitions. [2024-10-10 22:38:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-10 22:38:37,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:37,210 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-10-10 22:38:37,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:38:37,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:37,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 965395203, now seen corresponding path program 1 times [2024-10-10 22:38:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:37,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257538961] [2024-10-10 22:38:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:38:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257538961] [2024-10-10 22:38:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257538961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:37,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:37,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674830673] [2024-10-10 22:38:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:37,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:37,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:37,595 INFO L87 Difference]: Start difference. First operand 3319 states and 4263 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:38,490 INFO L93 Difference]: Finished difference Result 9899 states and 12716 transitions. [2024-10-10 22:38:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-10-10 22:38:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:38,514 INFO L225 Difference]: With dead ends: 9899 [2024-10-10 22:38:38,514 INFO L226 Difference]: Without dead ends: 6581 [2024-10-10 22:38:38,520 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 22:38:38,521 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:38,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 415 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2024-10-10 22:38:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6576. [2024-10-10 22:38:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 1.224486692015209) internal successors, (8051), 6575 states have internal predecessors, (8051), 0 states have call successors, (0), 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 22:38:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 8051 transitions. [2024-10-10 22:38:38,652 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 8051 transitions. Word has length 230 [2024-10-10 22:38:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:38,652 INFO L471 AbstractCegarLoop]: Abstraction has 6576 states and 8051 transitions. [2024-10-10 22:38:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 8051 transitions. [2024-10-10 22:38:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-10 22:38:38,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:38,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:38,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:38:38,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1431313764, now seen corresponding path program 1 times [2024-10-10 22:38:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507454877] [2024-10-10 22:38:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507454877] [2024-10-10 22:38:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507454877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579140814] [2024-10-10 22:38:39,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:39,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:39,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:39,234 INFO L87 Difference]: Start difference. First operand 6576 states and 8051 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 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 22:38:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:40,140 INFO L93 Difference]: Finished difference Result 16026 states and 19626 transitions. [2024-10-10 22:38:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-10 22:38:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:40,175 INFO L225 Difference]: With dead ends: 16026 [2024-10-10 22:38:40,175 INFO L226 Difference]: Without dead ends: 9451 [2024-10-10 22:38:40,186 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 22:38:40,187 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:40,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 192 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9451 states. [2024-10-10 22:38:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9451 to 9438. [2024-10-10 22:38:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9437 states have (on average 1.2135212461587368) internal successors, (11452), 9437 states have internal predecessors, (11452), 0 states have call successors, (0), 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 22:38:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 11452 transitions. [2024-10-10 22:38:40,378 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 11452 transitions. Word has length 236 [2024-10-10 22:38:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:40,379 INFO L471 AbstractCegarLoop]: Abstraction has 9438 states and 11452 transitions. [2024-10-10 22:38:40,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 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 22:38:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 11452 transitions. [2024-10-10 22:38:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-10 22:38:40,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:40,399 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:38:40,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -344880461, now seen corresponding path program 1 times [2024-10-10 22:38:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636965397] [2024-10-10 22:38:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636965397] [2024-10-10 22:38:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636965397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812312954] [2024-10-10 22:38:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:41,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:41,027 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 22:38:41,028 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 22:38:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:41,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:38:41,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:38:41,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812312954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:41,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:38:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851323735] [2024-10-10 22:38:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:41,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:41,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:41,546 INFO L87 Difference]: Start difference. First operand 9438 states and 11452 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:42,406 INFO L93 Difference]: Finished difference Result 18668 states and 22624 transitions. [2024-10-10 22:38:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2024-10-10 22:38:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:42,447 INFO L225 Difference]: With dead ends: 18668 [2024-10-10 22:38:42,448 INFO L226 Difference]: Without dead ends: 9231 [2024-10-10 22:38:42,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:42,464 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 82 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:42,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 376 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2024-10-10 22:38:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 9228. [2024-10-10 22:38:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9228 states, 9227 states have (on average 1.1769806004118348) internal successors, (10860), 9227 states have internal predecessors, (10860), 0 states have call successors, (0), 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 22:38:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9228 states to 9228 states and 10860 transitions. [2024-10-10 22:38:42,632 INFO L78 Accepts]: Start accepts. Automaton has 9228 states and 10860 transitions. Word has length 243 [2024-10-10 22:38:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:42,634 INFO L471 AbstractCegarLoop]: Abstraction has 9228 states and 10860 transitions. [2024-10-10 22:38:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9228 states and 10860 transitions. [2024-10-10 22:38:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-10 22:38:42,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:42,652 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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 22:38:42,674 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 22:38:42,853 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 22:38:42,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1454767301, now seen corresponding path program 1 times [2024-10-10 22:38:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655791923] [2024-10-10 22:38:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 22:38:43,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:43,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655791923] [2024-10-10 22:38:43,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655791923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:43,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352236045] [2024-10-10 22:38:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:43,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:43,245 INFO L87 Difference]: Start difference. First operand 9228 states and 10860 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 22:38:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:44,142 INFO L93 Difference]: Finished difference Result 21111 states and 24970 transitions. [2024-10-10 22:38:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 243 [2024-10-10 22:38:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:44,165 INFO L225 Difference]: With dead ends: 21111 [2024-10-10 22:38:44,166 INFO L226 Difference]: Without dead ends: 11884 [2024-10-10 22:38:44,177 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 22:38:44,178 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:44,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 414 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2024-10-10 22:38:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 11867. [2024-10-10 22:38:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11866 states have (on average 1.1538007753244564) internal successors, (13691), 11866 states have internal predecessors, (13691), 0 states have call successors, (0), 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 22:38:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 13691 transitions. [2024-10-10 22:38:44,444 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 13691 transitions. Word has length 243 [2024-10-10 22:38:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:44,444 INFO L471 AbstractCegarLoop]: Abstraction has 11867 states and 13691 transitions. [2024-10-10 22:38:44,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 22:38:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 13691 transitions. [2024-10-10 22:38:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-10 22:38:44,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:44,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:38:44,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:38:44,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:44,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash -605536390, now seen corresponding path program 1 times [2024-10-10 22:38:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652431312] [2024-10-10 22:38:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:45,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652431312] [2024-10-10 22:38:45,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652431312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:45,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746042183] [2024-10-10 22:38:45,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:45,150 INFO L87 Difference]: Start difference. First operand 11867 states and 13691 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 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 22:38:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:46,018 INFO L93 Difference]: Finished difference Result 27201 states and 31291 transitions. [2024-10-10 22:38:46,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:46,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2024-10-10 22:38:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:46,051 INFO L225 Difference]: With dead ends: 27201 [2024-10-10 22:38:46,051 INFO L226 Difference]: Without dead ends: 15538 [2024-10-10 22:38:46,068 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 22:38:46,069 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 183 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:46,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 192 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:38:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15538 states. [2024-10-10 22:38:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15538 to 15530. [2024-10-10 22:38:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15530 states, 15529 states have (on average 1.1405113014360229) internal successors, (17711), 15529 states have internal predecessors, (17711), 0 states have call successors, (0), 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 22:38:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15530 states to 15530 states and 17711 transitions. [2024-10-10 22:38:46,364 INFO L78 Accepts]: Start accepts. Automaton has 15530 states and 17711 transitions. Word has length 250 [2024-10-10 22:38:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:46,365 INFO L471 AbstractCegarLoop]: Abstraction has 15530 states and 17711 transitions. [2024-10-10 22:38:46,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 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 22:38:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15530 states and 17711 transitions. [2024-10-10 22:38:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-10 22:38:46,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:46,391 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:46,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:38:46,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:46,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1972623027, now seen corresponding path program 1 times [2024-10-10 22:38:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124789401] [2024-10-10 22:38:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:38:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124789401] [2024-10-10 22:38:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124789401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:46,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414921753] [2024-10-10 22:38:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:46,608 INFO L87 Difference]: Start difference. First operand 15530 states and 17711 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 22:38:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:47,060 INFO L93 Difference]: Finished difference Result 27358 states and 31323 transitions. [2024-10-10 22:38:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:47,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 256 [2024-10-10 22:38:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:47,089 INFO L225 Difference]: With dead ends: 27358 [2024-10-10 22:38:47,089 INFO L226 Difference]: Without dead ends: 14881 [2024-10-10 22:38:47,106 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 22:38:47,107 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 328 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:47,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:38:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14881 states. [2024-10-10 22:38:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14881 to 14881. [2024-10-10 22:38:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14881 states, 14880 states have (on average 1.1299059139784946) internal successors, (16813), 14880 states have internal predecessors, (16813), 0 states have call successors, (0), 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 22:38:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14881 states to 14881 states and 16813 transitions. [2024-10-10 22:38:47,309 INFO L78 Accepts]: Start accepts. Automaton has 14881 states and 16813 transitions. Word has length 256 [2024-10-10 22:38:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:47,310 INFO L471 AbstractCegarLoop]: Abstraction has 14881 states and 16813 transitions. [2024-10-10 22:38:47,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 22:38:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 14881 states and 16813 transitions. [2024-10-10 22:38:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-10 22:38:47,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:47,334 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:38:47,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -885213559, now seen corresponding path program 1 times [2024-10-10 22:38:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394290254] [2024-10-10 22:38:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394290254] [2024-10-10 22:38:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394290254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:47,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320272376] [2024-10-10 22:38:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:47,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:47,710 INFO L87 Difference]: Start difference. First operand 14881 states and 16813 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 22:38:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:48,396 INFO L93 Difference]: Finished difference Result 30366 states and 34488 transitions. [2024-10-10 22:38:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:48,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2024-10-10 22:38:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:48,439 INFO L225 Difference]: With dead ends: 30366 [2024-10-10 22:38:48,439 INFO L226 Difference]: Without dead ends: 18538 [2024-10-10 22:38:48,456 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 22:38:48,457 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 164 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:48,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 110 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18538 states. [2024-10-10 22:38:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18538 to 18332. [2024-10-10 22:38:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18332 states, 18331 states have (on average 1.128580001091048) internal successors, (20688), 18331 states have internal predecessors, (20688), 0 states have call successors, (0), 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 22:38:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18332 states to 18332 states and 20688 transitions. [2024-10-10 22:38:48,709 INFO L78 Accepts]: Start accepts. Automaton has 18332 states and 20688 transitions. Word has length 257 [2024-10-10 22:38:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 18332 states and 20688 transitions. [2024-10-10 22:38:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 22:38:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18332 states and 20688 transitions. [2024-10-10 22:38:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-10 22:38:48,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:48,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:38:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:38:48,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:48,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash 39683603, now seen corresponding path program 1 times [2024-10-10 22:38:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:48,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452391557] [2024-10-10 22:38:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:49,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:49,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452391557] [2024-10-10 22:38:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452391557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:49,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290987506] [2024-10-10 22:38:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:49,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:49,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:49,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:49,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:49,028 INFO L87 Difference]: Start difference. First operand 18332 states and 20688 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 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 22:38:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:49,712 INFO L93 Difference]: Finished difference Result 39501 states and 45009 transitions. [2024-10-10 22:38:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:49,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2024-10-10 22:38:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:49,754 INFO L225 Difference]: With dead ends: 39501 [2024-10-10 22:38:49,754 INFO L226 Difference]: Without dead ends: 21576 [2024-10-10 22:38:49,771 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 22:38:49,772 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:49,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 135 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21576 states. [2024-10-10 22:38:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21576 to 20355. [2024-10-10 22:38:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20355 states, 20354 states have (on average 1.1121155546821264) internal successors, (22636), 20354 states have internal predecessors, (22636), 0 states have call successors, (0), 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 22:38:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20355 states to 20355 states and 22636 transitions. [2024-10-10 22:38:50,047 INFO L78 Accepts]: Start accepts. Automaton has 20355 states and 22636 transitions. Word has length 285 [2024-10-10 22:38:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:50,047 INFO L471 AbstractCegarLoop]: Abstraction has 20355 states and 22636 transitions. [2024-10-10 22:38:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 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 22:38:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20355 states and 22636 transitions. [2024-10-10 22:38:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-10 22:38:50,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:50,070 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:50,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:38:50,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:50,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2127988335, now seen corresponding path program 1 times [2024-10-10 22:38:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:50,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675360854] [2024-10-10 22:38:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-10 22:38:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675360854] [2024-10-10 22:38:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675360854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:50,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537792065] [2024-10-10 22:38:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:50,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:50,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:50,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:50,501 INFO L87 Difference]: Start difference. First operand 20355 states and 22636 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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 22:38:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:51,228 INFO L93 Difference]: Finished difference Result 44987 states and 50336 transitions. [2024-10-10 22:38:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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 325 [2024-10-10 22:38:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:51,260 INFO L225 Difference]: With dead ends: 44987 [2024-10-10 22:38:51,260 INFO L226 Difference]: Without dead ends: 26054 [2024-10-10 22:38:51,279 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 22:38:51,280 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 158 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:51,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 143 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26054 states. [2024-10-10 22:38:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26054 to 23406. [2024-10-10 22:38:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23406 states, 23405 states have (on average 1.121555223242897) internal successors, (26250), 23405 states have internal predecessors, (26250), 0 states have call successors, (0), 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 22:38:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23406 states to 23406 states and 26250 transitions. [2024-10-10 22:38:51,682 INFO L78 Accepts]: Start accepts. Automaton has 23406 states and 26250 transitions. Word has length 325 [2024-10-10 22:38:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 23406 states and 26250 transitions. [2024-10-10 22:38:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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 22:38:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23406 states and 26250 transitions. [2024-10-10 22:38:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-10 22:38:51,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:51,716 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:38:51,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:38:51,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:51,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1672159855, now seen corresponding path program 1 times [2024-10-10 22:38:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883803528] [2024-10-10 22:38:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-10 22:38:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:53,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883803528] [2024-10-10 22:38:53,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883803528] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:53,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832078189] [2024-10-10 22:38:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:53,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:53,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:53,015 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 22:38:53,018 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 22:38:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:53,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:38:53,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-10 22:38:53,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832078189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:53,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:38:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917384205] [2024-10-10 22:38:53,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:53,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:53,568 INFO L87 Difference]: Start difference. First operand 23406 states and 26250 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 22:38:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:54,175 INFO L93 Difference]: Finished difference Result 44171 states and 49616 transitions. [2024-10-10 22:38:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:54,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 330 [2024-10-10 22:38:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:54,208 INFO L225 Difference]: With dead ends: 44171 [2024-10-10 22:38:54,208 INFO L226 Difference]: Without dead ends: 22390 [2024-10-10 22:38:54,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:54,229 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 67 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:54,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 287 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:38:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22390 states. [2024-10-10 22:38:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22390 to 21981. [2024-10-10 22:38:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21981 states, 21980 states have (on average 1.114604185623294) internal successors, (24499), 21980 states have internal predecessors, (24499), 0 states have call successors, (0), 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 22:38:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 24499 transitions. [2024-10-10 22:38:54,498 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 24499 transitions. Word has length 330 [2024-10-10 22:38:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 21981 states and 24499 transitions. [2024-10-10 22:38:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 22:38:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 24499 transitions. [2024-10-10 22:38:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-10 22:38:54,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:54,524 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:54,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:38:54,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 22:38:54,726 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:54,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash -911443079, now seen corresponding path program 1 times [2024-10-10 22:38:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013230816] [2024-10-10 22:38:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-10 22:38:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013230816] [2024-10-10 22:38:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013230816] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513514616] [2024-10-10 22:38:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:55,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:55,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:55,389 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 22:38:55,391 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 22:38:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:55,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:38:55,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:38:55,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513514616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:55,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:38:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863942204] [2024-10-10 22:38:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:55,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:55,717 INFO L87 Difference]: Start difference. First operand 21981 states and 24499 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 22:38:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:56,297 INFO L93 Difference]: Finished difference Result 43355 states and 48328 transitions. [2024-10-10 22:38:56,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:56,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2024-10-10 22:38:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:56,328 INFO L225 Difference]: With dead ends: 43355 [2024-10-10 22:38:56,328 INFO L226 Difference]: Without dead ends: 22999 [2024-10-10 22:38:56,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:56,346 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 134 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:56,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 44 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:38:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22999 states. [2024-10-10 22:38:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22999 to 21981. [2024-10-10 22:38:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21981 states, 21980 states have (on average 1.1142857142857143) internal successors, (24492), 21980 states have internal predecessors, (24492), 0 states have call successors, (0), 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 22:38:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 24492 transitions. [2024-10-10 22:38:56,601 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 24492 transitions. Word has length 379 [2024-10-10 22:38:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:56,601 INFO L471 AbstractCegarLoop]: Abstraction has 21981 states and 24492 transitions. [2024-10-10 22:38:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 22:38:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 24492 transitions. [2024-10-10 22:38:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 22:38:56,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:56,630 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:38:56,651 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 22:38:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:56,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:56,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -129593323, now seen corresponding path program 1 times [2024-10-10 22:38:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746095018] [2024-10-10 22:38:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 193 proven. 6 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-10-10 22:38:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746095018] [2024-10-10 22:38:58,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746095018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004239039] [2024-10-10 22:38:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:58,345 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 22:38:58,346 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 22:38:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:58,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:38:58,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 22:38:58,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004239039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:38:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661557470] [2024-10-10 22:38:58,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:58,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:58,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:58,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:58,752 INFO L87 Difference]: Start difference. First operand 21981 states and 24492 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 22:38:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:59,499 INFO L93 Difference]: Finished difference Result 52319 states and 58705 transitions. [2024-10-10 22:38:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 426 [2024-10-10 22:38:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:59,534 INFO L225 Difference]: With dead ends: 52319 [2024-10-10 22:38:59,534 INFO L226 Difference]: Without dead ends: 31557 [2024-10-10 22:38:59,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:59,551 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:59,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 96 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31557 states. [2024-10-10 22:38:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31557 to 30331. [2024-10-10 22:38:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30331 states, 30330 states have (on average 1.1136168809759315) internal successors, (33776), 30330 states have internal predecessors, (33776), 0 states have call successors, (0), 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 22:38:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30331 states to 30331 states and 33776 transitions. [2024-10-10 22:38:59,848 INFO L78 Accepts]: Start accepts. Automaton has 30331 states and 33776 transitions. Word has length 426 [2024-10-10 22:38:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:59,849 INFO L471 AbstractCegarLoop]: Abstraction has 30331 states and 33776 transitions. [2024-10-10 22:38:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 22:38:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30331 states and 33776 transitions. [2024-10-10 22:38:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-10-10 22:38:59,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:59,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:38:59,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:39:00,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:39:00,074 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1545228601, now seen corresponding path program 1 times [2024-10-10 22:39:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384899288] [2024-10-10 22:39:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-10 22:39:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384899288] [2024-10-10 22:39:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384899288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:00,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320262412] [2024-10-10 22:39:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:00,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:00,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:00,433 INFO L87 Difference]: Start difference. First operand 30331 states and 33776 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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 22:39:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:01,186 INFO L93 Difference]: Finished difference Result 76554 states and 85245 transitions. [2024-10-10 22:39:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:01,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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 446 [2024-10-10 22:39:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:01,243 INFO L225 Difference]: With dead ends: 76554 [2024-10-10 22:39:01,243 INFO L226 Difference]: Without dead ends: 47442 [2024-10-10 22:39:01,271 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 22:39:01,272 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:01,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 134 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47442 states. [2024-10-10 22:39:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47442 to 47441. [2024-10-10 22:39:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47441 states, 47440 states have (on average 1.1110876897133222) internal successors, (52710), 47440 states have internal predecessors, (52710), 0 states have call successors, (0), 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 22:39:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47441 states to 47441 states and 52710 transitions. [2024-10-10 22:39:01,889 INFO L78 Accepts]: Start accepts. Automaton has 47441 states and 52710 transitions. Word has length 446 [2024-10-10 22:39:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:01,889 INFO L471 AbstractCegarLoop]: Abstraction has 47441 states and 52710 transitions. [2024-10-10 22:39:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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 22:39:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 47441 states and 52710 transitions. [2024-10-10 22:39:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-10-10 22:39:01,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:01,925 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:01,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:39:01,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:01,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1231953494, now seen corresponding path program 1 times [2024-10-10 22:39:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:01,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808296976] [2024-10-10 22:39:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 242 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-10 22:39:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808296976] [2024-10-10 22:39:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808296976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209930419] [2024-10-10 22:39:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:03,462 INFO L229 MonitoredProcess]: Starting monitored process 6 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 22:39:03,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:39:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:03,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:39:03,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-10 22:39:03,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209930419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 22:39:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055806959] [2024-10-10 22:39:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:03,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:03,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:39:03,960 INFO L87 Difference]: Start difference. First operand 47441 states and 52710 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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 22:39:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:04,419 INFO L93 Difference]: Finished difference Result 110149 states and 122445 transitions. [2024-10-10 22:39:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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 453 [2024-10-10 22:39:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:04,488 INFO L225 Difference]: With dead ends: 110149 [2024-10-10 22:39:04,488 INFO L226 Difference]: Without dead ends: 64333 [2024-10-10 22:39:04,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:39:04,521 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 190 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:04,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 437 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:39:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64333 states. [2024-10-10 22:39:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64333 to 64331. [2024-10-10 22:39:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64331 states, 64330 states have (on average 1.110772578890098) internal successors, (71456), 64330 states have internal predecessors, (71456), 0 states have call successors, (0), 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 22:39:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64331 states to 64331 states and 71456 transitions. [2024-10-10 22:39:05,632 INFO L78 Accepts]: Start accepts. Automaton has 64331 states and 71456 transitions. Word has length 453 [2024-10-10 22:39:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:05,633 INFO L471 AbstractCegarLoop]: Abstraction has 64331 states and 71456 transitions. [2024-10-10 22:39:05,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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 22:39:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 64331 states and 71456 transitions. [2024-10-10 22:39:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2024-10-10 22:39:05,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:05,715 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:39:05,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:39:05,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:05,916 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:05,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash -969430958, now seen corresponding path program 1 times [2024-10-10 22:39:05,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:05,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230347913] [2024-10-10 22:39:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 494 proven. 6 refuted. 0 times theorem prover too weak. 1456 trivial. 0 not checked. [2024-10-10 22:39:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230347913] [2024-10-10 22:39:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230347913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081280148] [2024-10-10 22:39:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:08,739 INFO L229 MonitoredProcess]: Starting monitored process 7 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 22:39:08,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:39:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:09,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:39:09,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-10-10 22:39:09,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081280148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 22:39:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738409240] [2024-10-10 22:39:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:09,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:39:09,505 INFO L87 Difference]: Start difference. First operand 64331 states and 71456 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 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 22:39:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:10,171 INFO L93 Difference]: Finished difference Result 180355 states and 200718 transitions. [2024-10-10 22:39:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 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 790 [2024-10-10 22:39:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:10,322 INFO L225 Difference]: With dead ends: 180355 [2024-10-10 22:39:10,322 INFO L226 Difference]: Without dead ends: 117649 [2024-10-10 22:39:10,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:39:10,376 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 206 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:10,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 527 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:39:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117649 states. [2024-10-10 22:39:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117649 to 117640. [2024-10-10 22:39:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117640 states, 117639 states have (on average 1.1130832462023648) internal successors, (130942), 117639 states have internal predecessors, (130942), 0 states have call successors, (0), 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 22:39:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117640 states to 117640 states and 130942 transitions. [2024-10-10 22:39:12,445 INFO L78 Accepts]: Start accepts. Automaton has 117640 states and 130942 transitions. Word has length 790 [2024-10-10 22:39:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 117640 states and 130942 transitions. [2024-10-10 22:39:12,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 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 22:39:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 117640 states and 130942 transitions. [2024-10-10 22:39:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2024-10-10 22:39:12,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:12,604 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:12,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 22:39:12,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-10 22:39:12,805 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:12,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash -311667917, now seen corresponding path program 1 times [2024-10-10 22:39:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:12,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272733596] [2024-10-10 22:39:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2604 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 1905 trivial. 0 not checked. [2024-10-10 22:39:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272733596] [2024-10-10 22:39:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272733596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704120558] [2024-10-10 22:39:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:14,342 INFO L87 Difference]: Start difference. First operand 117640 states and 130942 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 2 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 22:39:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:15,435 INFO L93 Difference]: Finished difference Result 236912 states and 263671 transitions. [2024-10-10 22:39:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 2 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 913 [2024-10-10 22:39:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:15,597 INFO L225 Difference]: With dead ends: 236912 [2024-10-10 22:39:15,598 INFO L226 Difference]: Without dead ends: 120897 [2024-10-10 22:39:15,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:15,684 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 84 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:15,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 143 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120897 states. [2024-10-10 22:39:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120897 to 120482. [2024-10-10 22:39:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120482 states, 120481 states have (on average 1.1122666644533163) internal successors, (134007), 120481 states have internal predecessors, (134007), 0 states have call successors, (0), 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 22:39:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120482 states to 120482 states and 134007 transitions. [2024-10-10 22:39:18,169 INFO L78 Accepts]: Start accepts. Automaton has 120482 states and 134007 transitions. Word has length 913 [2024-10-10 22:39:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 120482 states and 134007 transitions. [2024-10-10 22:39:18,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 2 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 22:39:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 120482 states and 134007 transitions. [2024-10-10 22:39:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2024-10-10 22:39:18,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:18,390 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:18,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:39:18,391 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:18,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1881829654, now seen corresponding path program 1 times [2024-10-10 22:39:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:18,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016656324] [2024-10-10 22:39:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 2613 trivial. 0 not checked. [2024-10-10 22:39:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016656324] [2024-10-10 22:39:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016656324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:19,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982990108] [2024-10-10 22:39:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:19,621 INFO L87 Difference]: Start difference. First operand 120482 states and 134007 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 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 22:39:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:20,796 INFO L93 Difference]: Finished difference Result 244840 states and 272113 transitions. [2024-10-10 22:39:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:20,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 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 947 [2024-10-10 22:39:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:20,970 INFO L225 Difference]: With dead ends: 244840 [2024-10-10 22:39:20,970 INFO L226 Difference]: Without dead ends: 125780 [2024-10-10 22:39:21,060 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 22:39:21,061 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 190 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:21,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:39:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125780 states. [2024-10-10 22:39:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125780 to 125774. [2024-10-10 22:39:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125774 states, 125773 states have (on average 1.1101985322764027) internal successors, (139633), 125773 states have internal predecessors, (139633), 0 states have call successors, (0), 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 22:39:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125774 states to 125774 states and 139633 transitions. [2024-10-10 22:39:23,178 INFO L78 Accepts]: Start accepts. Automaton has 125774 states and 139633 transitions. Word has length 947 [2024-10-10 22:39:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:23,178 INFO L471 AbstractCegarLoop]: Abstraction has 125774 states and 139633 transitions. [2024-10-10 22:39:23,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 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 22:39:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 125774 states and 139633 transitions. [2024-10-10 22:39:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2024-10-10 22:39:23,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:23,296 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:39:23,296 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash 849276253, now seen corresponding path program 1 times [2024-10-10 22:39:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999255870] [2024-10-10 22:39:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:23,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3027 backedges. 618 proven. 6 refuted. 0 times theorem prover too weak. 2403 trivial. 0 not checked. [2024-10-10 22:39:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999255870] [2024-10-10 22:39:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999255870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188620157] [2024-10-10 22:39:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:26,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:26,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:26,951 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:39:26,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:39:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:27,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:39:27,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3027 backedges. 1571 proven. 0 refuted. 0 times theorem prover too weak. 1456 trivial. 0 not checked. [2024-10-10 22:39:27,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188620157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:39:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222123175] [2024-10-10 22:39:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:39:27,472 INFO L87 Difference]: Start difference. First operand 125774 states and 139633 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 22:39:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:28,367 INFO L93 Difference]: Finished difference Result 309107 states and 343546 transitions. [2024-10-10 22:39:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:28,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 961 [2024-10-10 22:39:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:28,595 INFO L225 Difference]: With dead ends: 309107 [2024-10-10 22:39:28,595 INFO L226 Difference]: Without dead ends: 187193 [2024-10-10 22:39:28,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:39:28,693 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 256 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:28,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 806 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:39:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187193 states. [2024-10-10 22:39:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187193 to 182518. [2024-10-10 22:39:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182518 states, 182517 states have (on average 1.1005331010262058) internal successors, (200866), 182517 states have internal predecessors, (200866), 0 states have call successors, (0), 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 22:39:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182518 states to 182518 states and 200866 transitions. [2024-10-10 22:39:31,814 INFO L78 Accepts]: Start accepts. Automaton has 182518 states and 200866 transitions. Word has length 961 [2024-10-10 22:39:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:31,814 INFO L471 AbstractCegarLoop]: Abstraction has 182518 states and 200866 transitions. [2024-10-10 22:39:31,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 22:39:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 182518 states and 200866 transitions. [2024-10-10 22:39:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2024-10-10 22:39:31,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:31,981 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:31,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 22:39:32,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:32,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:32,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 159149038, now seen corresponding path program 1 times [2024-10-10 22:39:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520558134] [2024-10-10 22:39:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3801 backedges. 498 proven. 6 refuted. 0 times theorem prover too weak. 3297 trivial. 0 not checked. [2024-10-10 22:39:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520558134] [2024-10-10 22:39:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520558134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481738072] [2024-10-10 22:39:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:34,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:34,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:34,407 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:39:34,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:39:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:34,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:39:34,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3801 backedges. 2303 proven. 0 refuted. 0 times theorem prover too weak. 1498 trivial. 0 not checked. [2024-10-10 22:39:35,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:35,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481738072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:35,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:35,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:39:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597823171] [2024-10-10 22:39:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:35,411 INFO L87 Difference]: Start difference. First operand 182518 states and 200866 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 22:39:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:37,097 INFO L93 Difference]: Finished difference Result 482080 states and 530594 transitions. [2024-10-10 22:39:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 1033 [2024-10-10 22:39:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:37,646 INFO L225 Difference]: With dead ends: 482080 [2024-10-10 22:39:37,646 INFO L226 Difference]: Without dead ends: 308716 [2024-10-10 22:39:37,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:37,802 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 191 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:37,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 554 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:39:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308716 states.