./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/Problem15_label07.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/Problem15_label07.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 496f4b0b7816aa03b8a4c1153581ca52fffcd239004f8a1c536179ce4f046e04 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:35:27,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:35:27,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:35:28,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:35:28,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:35:28,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:35:28,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:35:28,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:35:28,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:35:28,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:35:28,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:35:28,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:35:28,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:35:28,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:35:28,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:35:28,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:35:28,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:35:28,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:35:28,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:35:28,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:35:28,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:35:28,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:35:28,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:35:28,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:35:28,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:35:28,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:35:28,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:35:28,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:35:28,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:35:28,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:35:28,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:35:28,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:35:28,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:35:28,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:35:28,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:35:28,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:35:28,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:35:28,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:35:28,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:35:28,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:35:28,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:35:28,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:35:28,048 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 -> 496f4b0b7816aa03b8a4c1153581ca52fffcd239004f8a1c536179ce4f046e04 [2024-10-10 23:35:28,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:35:28,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:35:28,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:35:28,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:35:28,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:35:28,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label07.c [2024-10-10 23:35:29,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:35:30,153 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:35:30,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label07.c [2024-10-10 23:35:30,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/14ff93529/3961bb2804c04cafa14ec75c42b535a1/FLAGc0a996d2f [2024-10-10 23:35:30,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/14ff93529/3961bb2804c04cafa14ec75c42b535a1 [2024-10-10 23:35:30,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:35:30,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:35:30,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:35:30,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:35:30,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:35:30,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:35:30" (1/1) ... [2024-10-10 23:35:30,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c17ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:30, skipping insertion in model container [2024-10-10 23:35:30,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:35:30" (1/1) ... [2024-10-10 23:35:30,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:35:30,475 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/Problem15_label07.c[1469,1482] [2024-10-10 23:35:30,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:35:30,966 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:35:30,983 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/Problem15_label07.c[1469,1482] [2024-10-10 23:35:31,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:35:31,180 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:35:31,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31 WrapperNode [2024-10-10 23:35:31,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:35:31,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:35:31,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:35:31,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:35:31,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,392 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-10 23:35:31,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:35:31,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:35:31,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:35:31,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:35:31,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,584 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:35:31,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:35:31,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:35:31,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:35:31,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:35:31,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (1/1) ... [2024-10-10 23:35:31,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:35:31,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:31,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:35:31,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:35:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:35:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:35:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:35:31,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:35:31,984 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:35:31,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:35:34,392 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-10 23:35:34,392 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:35:34,449 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:35:34,453 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:35:34,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:34 BoogieIcfgContainer [2024-10-10 23:35:34,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:35:34,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:35:34,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:35:34,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:35:34,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:35:30" (1/3) ... [2024-10-10 23:35:34,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216d6ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:35:34, skipping insertion in model container [2024-10-10 23:35:34,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:35:31" (2/3) ... [2024-10-10 23:35:34,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216d6ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:35:34, skipping insertion in model container [2024-10-10 23:35:34,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:34" (3/3) ... [2024-10-10 23:35:34,466 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label07.c [2024-10-10 23:35:34,483 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:35:34,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:35:34,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:35:34,572 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;@46a8735e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:35:34,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:35:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:35:34,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:34,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:34,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1920851510, now seen corresponding path program 1 times [2024-10-10 23:35:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261715491] [2024-10-10 23:35:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:34,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261715491] [2024-10-10 23:35:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261715491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431473608] [2024-10-10 23:35:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:35:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:34,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:35:34,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:35:34,809 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:34,881 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-10 23:35:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:35:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:35:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:34,898 INFO L225 Difference]: With dead ends: 723 [2024-10-10 23:35:34,898 INFO L226 Difference]: Without dead ends: 360 [2024-10-10 23:35:34,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:35:34,904 INFO L432 NwaCegarLoop]: 623 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, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:34,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:35:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-10 23:35:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-10 23:35:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-10 23:35:34,979 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 9 [2024-10-10 23:35:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:34,980 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-10 23:35:34,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-10 23:35:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:35:34,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:34,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:34,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:35:34,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:34,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 633327712, now seen corresponding path program 1 times [2024-10-10 23:35:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206717927] [2024-10-10 23:35:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:35,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:35,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206717927] [2024-10-10 23:35:35,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206717927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:35,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:35,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782401003] [2024-10-10 23:35:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:35,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:35,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:35,082 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:36,971 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-10 23:35:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:35:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:36,975 INFO L225 Difference]: With dead ends: 1025 [2024-10-10 23:35:36,976 INFO L226 Difference]: Without dead ends: 666 [2024-10-10 23:35:36,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:36,979 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 318 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:36,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:35:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-10 23:35:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-10 23:35:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-10 23:35:37,027 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 9 [2024-10-10 23:35:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:37,027 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-10 23:35:37,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-10 23:35:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-10 23:35:37,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:37,031 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] [2024-10-10 23:35:37,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:35:37,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1449635825, now seen corresponding path program 1 times [2024-10-10 23:35:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675396810] [2024-10-10 23:35:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:37,308 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 23:35:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:37,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675396810] [2024-10-10 23:35:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675396810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:37,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468374720] [2024-10-10 23:35:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:37,311 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:38,989 INFO L93 Difference]: Finished difference Result 1952 states and 2892 transitions. [2024-10-10 23:35:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-10 23:35:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:38,994 INFO L225 Difference]: With dead ends: 1952 [2024-10-10 23:35:38,995 INFO L226 Difference]: Without dead ends: 1289 [2024-10-10 23:35:38,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:38,997 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:38,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 323 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:35:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-10 23:35:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1281. [2024-10-10 23:35:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2024-10-10 23:35:39,026 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 84 [2024-10-10 23:35:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:39,027 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2024-10-10 23:35:39,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2024-10-10 23:35:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-10 23:35:39,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:39,031 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] [2024-10-10 23:35:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:35:39,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1510369861, now seen corresponding path program 1 times [2024-10-10 23:35:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094224520] [2024-10-10 23:35:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:39,182 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 23:35:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094224520] [2024-10-10 23:35:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094224520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:39,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670486389] [2024-10-10 23:35:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:39,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:39,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:39,185 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:40,757 INFO L93 Difference]: Finished difference Result 3763 states and 5262 transitions. [2024-10-10 23:35:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-10 23:35:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:40,767 INFO L225 Difference]: With dead ends: 3763 [2024-10-10 23:35:40,767 INFO L226 Difference]: Without dead ends: 2483 [2024-10-10 23:35:40,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:40,771 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:40,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:35:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-10 23:35:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-10 23:35:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.281651376146789) internal successors, (2794), 2180 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2794 transitions. [2024-10-10 23:35:40,810 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2794 transitions. Word has length 88 [2024-10-10 23:35:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:40,811 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2794 transitions. [2024-10-10 23:35:40,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2794 transitions. [2024-10-10 23:35:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-10 23:35:40,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:40,815 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:40,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:35:40,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:40,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1775086459, now seen corresponding path program 1 times [2024-10-10 23:35:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:40,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365119830] [2024-10-10 23:35:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:35:41,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:41,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365119830] [2024-10-10 23:35:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365119830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:41,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:41,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:41,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452842225] [2024-10-10 23:35:41,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:41,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:41,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:41,185 INFO L87 Difference]: Start difference. First operand 2181 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:42,637 INFO L93 Difference]: Finished difference Result 6165 states and 7960 transitions. [2024-10-10 23:35:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 179 [2024-10-10 23:35:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:42,650 INFO L225 Difference]: With dead ends: 6165 [2024-10-10 23:35:42,650 INFO L226 Difference]: Without dead ends: 3985 [2024-10-10 23:35:42,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:42,654 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:42,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:35:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-10 23:35:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-10 23:35:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2024-10-10 23:35:42,720 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 179 [2024-10-10 23:35:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:42,721 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2024-10-10 23:35:42,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2024-10-10 23:35:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-10 23:35:42,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:42,729 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:42,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:35:42,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:42,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash -867442741, now seen corresponding path program 1 times [2024-10-10 23:35:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855084709] [2024-10-10 23:35:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:35:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855084709] [2024-10-10 23:35:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855084709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487693460] [2024-10-10 23:35:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:43,427 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:44,593 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2024-10-10 23:35:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 281 [2024-10-10 23:35:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:44,607 INFO L225 Difference]: With dead ends: 7660 [2024-10-10 23:35:44,608 INFO L226 Difference]: Without dead ends: 3980 [2024-10-10 23:35:44,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:44,613 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:44,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:35:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-10 23:35:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-10 23:35:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2024-10-10 23:35:44,677 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 281 [2024-10-10 23:35:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:44,678 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2024-10-10 23:35:44,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2024-10-10 23:35:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-10-10 23:35:44,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:44,682 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:35:44,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 599492432, now seen corresponding path program 1 times [2024-10-10 23:35:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022521888] [2024-10-10 23:35:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:35:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022521888] [2024-10-10 23:35:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022521888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:44,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038677493] [2024-10-10 23:35:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:44,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:44,961 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:46,533 INFO L93 Difference]: Finished difference Result 8856 states and 10952 transitions. [2024-10-10 23:35:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2024-10-10 23:35:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:46,548 INFO L225 Difference]: With dead ends: 8856 [2024-10-10 23:35:46,549 INFO L226 Difference]: Without dead ends: 5176 [2024-10-10 23:35:46,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:46,555 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 304 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:46,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:35:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2024-10-10 23:35:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3677. [2024-10-10 23:35:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3676 states have (on average 1.218171926006529) internal successors, (4478), 3676 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4478 transitions. [2024-10-10 23:35:46,618 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4478 transitions. Word has length 296 [2024-10-10 23:35:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:46,619 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 4478 transitions. [2024-10-10 23:35:46,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4478 transitions. [2024-10-10 23:35:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-10 23:35:46,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:46,624 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:46,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:35:46,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:46,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 368493341, now seen corresponding path program 1 times [2024-10-10 23:35:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628032108] [2024-10-10 23:35:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:35:47,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:47,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628032108] [2024-10-10 23:35:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628032108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359586864] [2024-10-10 23:35:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:47,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:47,023 INFO L87 Difference]: Start difference. First operand 3677 states and 4478 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:48,586 INFO L93 Difference]: Finished difference Result 9156 states and 11368 transitions. [2024-10-10 23:35:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:48,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 355 [2024-10-10 23:35:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:48,599 INFO L225 Difference]: With dead ends: 9156 [2024-10-10 23:35:48,599 INFO L226 Difference]: Without dead ends: 5779 [2024-10-10 23:35:48,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:48,605 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 318 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:48,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:35:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2024-10-10 23:35:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5181. [2024-10-10 23:35:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5180 states have (on average 1.1768339768339768) internal successors, (6096), 5180 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 6096 transitions. [2024-10-10 23:35:48,690 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 6096 transitions. Word has length 355 [2024-10-10 23:35:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:48,691 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 6096 transitions. [2024-10-10 23:35:48,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 6096 transitions. [2024-10-10 23:35:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-10-10 23:35:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:48,696 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:35:48,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1212348303, now seen corresponding path program 1 times [2024-10-10 23:35:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072293626] [2024-10-10 23:35:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:49,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072293626] [2024-10-10 23:35:49,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072293626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217887797] [2024-10-10 23:35:49,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:49,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:49,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:49,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:49,031 INFO L87 Difference]: Start difference. First operand 5181 states and 6096 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:50,433 INFO L93 Difference]: Finished difference Result 11867 states and 14276 transitions. [2024-10-10 23:35:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2024-10-10 23:35:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:50,457 INFO L225 Difference]: With dead ends: 11867 [2024-10-10 23:35:50,457 INFO L226 Difference]: Without dead ends: 6986 [2024-10-10 23:35:50,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:50,463 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:50,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 600 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:35:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2024-10-10 23:35:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 6086. [2024-10-10 23:35:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.162859490550534) internal successors, (7076), 6085 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7076 transitions. [2024-10-10 23:35:50,546 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7076 transitions. Word has length 361 [2024-10-10 23:35:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:50,547 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 7076 transitions. [2024-10-10 23:35:50,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7076 transitions. [2024-10-10 23:35:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:35:50,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:50,552 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:35:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:35:50,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1612937311, now seen corresponding path program 1 times [2024-10-10 23:35:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987510639] [2024-10-10 23:35:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:35:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987510639] [2024-10-10 23:35:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987510639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679810855] [2024-10-10 23:35:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:50,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:50,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:50,872 INFO L87 Difference]: Start difference. First operand 6086 states and 7076 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:52,148 INFO L93 Difference]: Finished difference Result 13666 states and 16223 transitions. [2024-10-10 23:35:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 378 [2024-10-10 23:35:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:52,166 INFO L225 Difference]: With dead ends: 13666 [2024-10-10 23:35:52,166 INFO L226 Difference]: Without dead ends: 7880 [2024-10-10 23:35:52,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:52,172 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:52,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 614 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:35:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2024-10-10 23:35:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7876. [2024-10-10 23:35:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1457777777777778) internal successors, (9023), 7875 states have internal predecessors, (9023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9023 transitions. [2024-10-10 23:35:52,265 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9023 transitions. Word has length 378 [2024-10-10 23:35:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:52,266 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9023 transitions. [2024-10-10 23:35:52,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9023 transitions. [2024-10-10 23:35:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-10-10 23:35:52,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:52,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:35:52,270 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash -53047249, now seen corresponding path program 1 times [2024-10-10 23:35:52,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:52,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318489408] [2024-10-10 23:35:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 8 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318489408] [2024-10-10 23:35:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318489408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821459192] [2024-10-10 23:35:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:52,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:52,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:52,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:52,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:35:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:53,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:35:53,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:35:58,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821459192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:35:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777804411] [2024-10-10 23:35:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:58,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:58,516 INFO L87 Difference]: Start difference. First operand 7876 states and 9023 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:59,774 INFO L93 Difference]: Finished difference Result 20242 states and 23285 transitions. [2024-10-10 23:35:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:59,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 386 [2024-10-10 23:35:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:59,796 INFO L225 Difference]: With dead ends: 20242 [2024-10-10 23:35:59,797 INFO L226 Difference]: Without dead ends: 12666 [2024-10-10 23:35:59,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:59,807 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 371 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:59,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 176 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:35:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12666 states. [2024-10-10 23:35:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12666 to 10869. [2024-10-10 23:35:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10869 states, 10868 states have (on average 1.146945160103055) internal successors, (12465), 10868 states have internal predecessors, (12465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 12465 transitions. [2024-10-10 23:35:59,936 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 12465 transitions. Word has length 386 [2024-10-10 23:35:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:59,937 INFO L471 AbstractCegarLoop]: Abstraction has 10869 states and 12465 transitions. [2024-10-10 23:35:59,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 12465 transitions. [2024-10-10 23:35:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-10-10 23:35:59,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:59,941 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-10 23:35:59,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:36:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:36:00,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2006527135, now seen corresponding path program 1 times [2024-10-10 23:36:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213028606] [2024-10-10 23:36:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-10 23:36:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213028606] [2024-10-10 23:36:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213028606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882026187] [2024-10-10 23:36:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:00,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:00,638 INFO L87 Difference]: Start difference. First operand 10869 states and 12465 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:02,031 INFO L93 Difference]: Finished difference Result 26836 states and 31060 transitions. [2024-10-10 23:36:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 497 [2024-10-10 23:36:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:02,056 INFO L225 Difference]: With dead ends: 26836 [2024-10-10 23:36:02,056 INFO L226 Difference]: Without dead ends: 16267 [2024-10-10 23:36:02,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:02,068 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:02,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 617 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:36:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16267 states. [2024-10-10 23:36:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16267 to 15656. [2024-10-10 23:36:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15656 states, 15655 states have (on average 1.1357393803896518) internal successors, (17780), 15655 states have internal predecessors, (17780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15656 states to 15656 states and 17780 transitions. [2024-10-10 23:36:02,245 INFO L78 Accepts]: Start accepts. Automaton has 15656 states and 17780 transitions. Word has length 497 [2024-10-10 23:36:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:02,246 INFO L471 AbstractCegarLoop]: Abstraction has 15656 states and 17780 transitions. [2024-10-10 23:36:02,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 15656 states and 17780 transitions. [2024-10-10 23:36:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-10-10 23:36:02,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:02,252 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:02,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:36:02,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:02,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 558641239, now seen corresponding path program 1 times [2024-10-10 23:36:02,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:02,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137739698] [2024-10-10 23:36:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-10 23:36:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137739698] [2024-10-10 23:36:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137739698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:02,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008786736] [2024-10-10 23:36:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:02,641 INFO L87 Difference]: Start difference. First operand 15656 states and 17780 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:03,785 INFO L93 Difference]: Finished difference Result 31308 states and 35592 transitions. [2024-10-10 23:36:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 510 [2024-10-10 23:36:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:03,809 INFO L225 Difference]: With dead ends: 31308 [2024-10-10 23:36:03,809 INFO L226 Difference]: Without dead ends: 15952 [2024-10-10 23:36:03,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:03,826 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:03,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 69 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:36:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15952 states. [2024-10-10 23:36:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15952 to 15652. [2024-10-10 23:36:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15652 states, 15651 states have (on average 1.13558239090154) internal successors, (17773), 15651 states have internal predecessors, (17773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15652 states to 15652 states and 17773 transitions. [2024-10-10 23:36:03,989 INFO L78 Accepts]: Start accepts. Automaton has 15652 states and 17773 transitions. Word has length 510 [2024-10-10 23:36:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:03,989 INFO L471 AbstractCegarLoop]: Abstraction has 15652 states and 17773 transitions. [2024-10-10 23:36:03,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15652 states and 17773 transitions. [2024-10-10 23:36:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-10-10 23:36:03,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:03,996 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:03,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:36:03,996 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:03,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 546715397, now seen corresponding path program 1 times [2024-10-10 23:36:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376565002] [2024-10-10 23:36:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-10 23:36:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:04,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376565002] [2024-10-10 23:36:04,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376565002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:04,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:04,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732456589] [2024-10-10 23:36:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:04,357 INFO L87 Difference]: Start difference. First operand 15652 states and 17773 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:05,500 INFO L93 Difference]: Finished difference Result 32798 states and 37287 transitions. [2024-10-10 23:36:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 530 [2024-10-10 23:36:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:05,516 INFO L225 Difference]: With dead ends: 32798 [2024-10-10 23:36:05,516 INFO L226 Difference]: Without dead ends: 17446 [2024-10-10 23:36:05,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:05,527 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 265 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:05,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 329 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:36:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17446 states. [2024-10-10 23:36:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17446 to 13556. [2024-10-10 23:36:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13556 states, 13555 states have (on average 1.1454075986720766) internal successors, (15526), 13555 states have internal predecessors, (15526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13556 states to 13556 states and 15526 transitions. [2024-10-10 23:36:05,681 INFO L78 Accepts]: Start accepts. Automaton has 13556 states and 15526 transitions. Word has length 530 [2024-10-10 23:36:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 13556 states and 15526 transitions. [2024-10-10 23:36:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 13556 states and 15526 transitions. [2024-10-10 23:36:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-10-10 23:36:05,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:05,688 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 23:36:05,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:36:05,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:05,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1075199863, now seen corresponding path program 1 times [2024-10-10 23:36:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283163415] [2024-10-10 23:36:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 483 proven. 39 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-10-10 23:36:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283163415] [2024-10-10 23:36:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283163415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:36:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946137409] [2024-10-10 23:36:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:06,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:36:06,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:36:06,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:36:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:06,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:36:06,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:36:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-10 23:36:06,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:36:06,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946137409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:36:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:36:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113540323] [2024-10-10 23:36:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:06,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:36:06,530 INFO L87 Difference]: Start difference. First operand 13556 states and 15526 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:07,682 INFO L93 Difference]: Finished difference Result 29801 states and 34428 transitions. [2024-10-10 23:36:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2024-10-10 23:36:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:07,699 INFO L225 Difference]: With dead ends: 29801 [2024-10-10 23:36:07,699 INFO L226 Difference]: Without dead ends: 16545 [2024-10-10 23:36:07,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:36:07,710 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 403 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:07,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 442 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:36:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16545 states. [2024-10-10 23:36:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16545 to 16545. [2024-10-10 23:36:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16545 states, 16544 states have (on average 1.1320720502901354) internal successors, (18729), 16544 states have internal predecessors, (18729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 18729 transitions. [2024-10-10 23:36:07,885 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 18729 transitions. Word has length 537 [2024-10-10 23:36:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:07,885 INFO L471 AbstractCegarLoop]: Abstraction has 16545 states and 18729 transitions. [2024-10-10 23:36:07,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 18729 transitions. [2024-10-10 23:36:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-10-10 23:36:07,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:07,896 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:07,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:36:08,096 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 23:36:08,097 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 833654819, now seen corresponding path program 1 times [2024-10-10 23:36:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250471978] [2024-10-10 23:36:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:36:08,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:08,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250471978] [2024-10-10 23:36:08,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250471978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:08,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:08,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097710194] [2024-10-10 23:36:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:08,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:08,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:08,619 INFO L87 Difference]: Start difference. First operand 16545 states and 18729 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:09,840 INFO L93 Difference]: Finished difference Result 40866 states and 46390 transitions. [2024-10-10 23:36:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 571 [2024-10-10 23:36:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:09,861 INFO L225 Difference]: With dead ends: 40866 [2024-10-10 23:36:09,861 INFO L226 Difference]: Without dead ends: 21631 [2024-10-10 23:36:09,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:09,875 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 179 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:09,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 520 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:36:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2024-10-10 23:36:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 19537. [2024-10-10 23:36:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19537 states, 19536 states have (on average 1.0825143325143325) internal successors, (21148), 19536 states have internal predecessors, (21148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19537 states to 19537 states and 21148 transitions. [2024-10-10 23:36:10,071 INFO L78 Accepts]: Start accepts. Automaton has 19537 states and 21148 transitions. Word has length 571 [2024-10-10 23:36:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:10,072 INFO L471 AbstractCegarLoop]: Abstraction has 19537 states and 21148 transitions. [2024-10-10 23:36:10,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19537 states and 21148 transitions. [2024-10-10 23:36:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2024-10-10 23:36:10,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:10,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:36:10,082 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1261514869, now seen corresponding path program 1 times [2024-10-10 23:36:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247830082] [2024-10-10 23:36:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 100 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:36:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247830082] [2024-10-10 23:36:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247830082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:36:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25299692] [2024-10-10 23:36:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:36:11,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:36:11,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:36:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:12,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-10 23:36:12,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:36:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 398 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:36:14,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:36:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 398 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:36:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25299692] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:36:16,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:36:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-10-10 23:36:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123485819] [2024-10-10 23:36:16,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:36:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 23:36:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 23:36:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-10 23:36:16,441 INFO L87 Difference]: Start difference. First operand 19537 states and 21148 transitions. Second operand has 11 states, 11 states have (on average 119.27272727272727) internal successors, (1312), 11 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:25,452 INFO L93 Difference]: Finished difference Result 65494 states and 69962 transitions. [2024-10-10 23:36:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-10 23:36:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 119.27272727272727) internal successors, (1312), 11 states have internal predecessors, (1312), 0 states have call successors, (0), 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 681 [2024-10-10 23:36:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:25,494 INFO L225 Difference]: With dead ends: 65494 [2024-10-10 23:36:25,494 INFO L226 Difference]: Without dead ends: 43921 [2024-10-10 23:36:25,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1440 GetRequests, 1386 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2024-10-10 23:36:25,517 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 7960 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 12034 mSolverCounterSat, 2051 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7960 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 14085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2051 IncrementalHoareTripleChecker+Valid, 12034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:25,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7960 Valid, 415 Invalid, 14085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2051 Valid, 12034 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-10-10 23:36:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43921 states. [2024-10-10 23:36:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43921 to 21331. [2024-10-10 23:36:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21331 states, 21330 states have (on average 1.0652601969057665) internal successors, (22722), 21330 states have internal predecessors, (22722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 22722 transitions. [2024-10-10 23:36:25,951 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 22722 transitions. Word has length 681 [2024-10-10 23:36:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 21331 states and 22722 transitions. [2024-10-10 23:36:25,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 119.27272727272727) internal successors, (1312), 11 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 22722 transitions. [2024-10-10 23:36:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2024-10-10 23:36:25,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:25,966 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:36:25,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:36:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:26,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1278120181, now seen corresponding path program 1 times [2024-10-10 23:36:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141965741] [2024-10-10 23:36:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-10-10 23:36:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:26,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141965741] [2024-10-10 23:36:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141965741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:26,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:36:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251093063] [2024-10-10 23:36:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:36:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:36:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:36:26,756 INFO L87 Difference]: Start difference. First operand 21331 states and 22722 transitions. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:28,230 INFO L93 Difference]: Finished difference Result 50157 states and 53279 transitions. [2024-10-10 23:36:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:36:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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 708 [2024-10-10 23:36:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:28,259 INFO L225 Difference]: With dead ends: 50157 [2024-10-10 23:36:28,259 INFO L226 Difference]: Without dead ends: 29126 [2024-10-10 23:36:28,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:36:28,273 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 557 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:28,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 140 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:36:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29126 states. [2024-10-10 23:36:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29126 to 27027. [2024-10-10 23:36:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27027 states, 27026 states have (on average 1.0617183452971213) internal successors, (28694), 27026 states have internal predecessors, (28694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27027 states to 27027 states and 28694 transitions. [2024-10-10 23:36:28,567 INFO L78 Accepts]: Start accepts. Automaton has 27027 states and 28694 transitions. Word has length 708 [2024-10-10 23:36:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 27027 states and 28694 transitions. [2024-10-10 23:36:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27027 states and 28694 transitions. [2024-10-10 23:36:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2024-10-10 23:36:28,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:28,580 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:28,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:36:28,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 593512346, now seen corresponding path program 1 times [2024-10-10 23:36:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572870296] [2024-10-10 23:36:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-10-10 23:36:29,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:29,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572870296] [2024-10-10 23:36:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572870296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:29,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104564477] [2024-10-10 23:36:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:29,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:29,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:29,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:29,030 INFO L87 Difference]: Start difference. First operand 27027 states and 28694 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:29,952 INFO L93 Difference]: Finished difference Result 56442 states and 59958 transitions. [2024-10-10 23:36:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 775 [2024-10-10 23:36:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:29,983 INFO L225 Difference]: With dead ends: 56442 [2024-10-10 23:36:29,984 INFO L226 Difference]: Without dead ends: 27921 [2024-10-10 23:36:29,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:29,999 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 221 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:30,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 472 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:36:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27921 states. [2024-10-10 23:36:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27921 to 23425. [2024-10-10 23:36:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23425 states, 23424 states have (on average 1.055114412568306) internal successors, (24715), 23424 states have internal predecessors, (24715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23425 states to 23425 states and 24715 transitions. [2024-10-10 23:36:30,192 INFO L78 Accepts]: Start accepts. Automaton has 23425 states and 24715 transitions. Word has length 775 [2024-10-10 23:36:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:30,192 INFO L471 AbstractCegarLoop]: Abstraction has 23425 states and 24715 transitions. [2024-10-10 23:36:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 23425 states and 24715 transitions. [2024-10-10 23:36:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2024-10-10 23:36:30,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:30,254 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:30,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:36:30,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:30,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1248905641, now seen corresponding path program 1 times [2024-10-10 23:36:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228059615] [2024-10-10 23:36:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 1035 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-10 23:36:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228059615] [2024-10-10 23:36:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228059615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511897224] [2024-10-10 23:36:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:30,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:30,689 INFO L87 Difference]: Start difference. First operand 23425 states and 24715 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:31,500 INFO L93 Difference]: Finished difference Result 43833 states and 46022 transitions. [2024-10-10 23:36:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 831 [2024-10-10 23:36:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:31,518 INFO L225 Difference]: With dead ends: 43833 [2024-10-10 23:36:31,518 INFO L226 Difference]: Without dead ends: 20708 [2024-10-10 23:36:31,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:31,531 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 205 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:31,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 86 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:36:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20708 states. [2024-10-10 23:36:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20708 to 17702. [2024-10-10 23:36:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17702 states, 17701 states have (on average 1.0440653070447998) internal successors, (18481), 17701 states have internal predecessors, (18481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17702 states to 17702 states and 18481 transitions. [2024-10-10 23:36:31,675 INFO L78 Accepts]: Start accepts. Automaton has 17702 states and 18481 transitions. Word has length 831 [2024-10-10 23:36:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:31,676 INFO L471 AbstractCegarLoop]: Abstraction has 17702 states and 18481 transitions. [2024-10-10 23:36:31,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states and 18481 transitions. [2024-10-10 23:36:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2024-10-10 23:36:31,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:31,687 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:36:31,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:36:31,687 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:31,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1527378989, now seen corresponding path program 1 times [2024-10-10 23:36:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:31,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602543334] [2024-10-10 23:36:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-10 23:36:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602543334] [2024-10-10 23:36:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602543334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299437388] [2024-10-10 23:36:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:32,196 INFO L87 Difference]: Start difference. First operand 17702 states and 18481 transitions. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:32,983 INFO L93 Difference]: Finished difference Result 37806 states and 39540 transitions. [2024-10-10 23:36:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:32,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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 857 [2024-10-10 23:36:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:33,001 INFO L225 Difference]: With dead ends: 37806 [2024-10-10 23:36:33,001 INFO L226 Difference]: Without dead ends: 20404 [2024-10-10 23:36:33,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:33,012 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 321 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:33,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 91 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:36:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2024-10-10 23:36:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 17401. [2024-10-10 23:36:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17401 states, 17400 states have (on average 1.0444827586206897) internal successors, (18174), 17400 states have internal predecessors, (18174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17401 states to 17401 states and 18174 transitions. [2024-10-10 23:36:33,148 INFO L78 Accepts]: Start accepts. Automaton has 17401 states and 18174 transitions. Word has length 857 [2024-10-10 23:36:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:33,148 INFO L471 AbstractCegarLoop]: Abstraction has 17401 states and 18174 transitions. [2024-10-10 23:36:33,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 17401 states and 18174 transitions. [2024-10-10 23:36:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2024-10-10 23:36:33,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:33,159 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:36:33,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:36:33,160 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:33,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -654324679, now seen corresponding path program 1 times [2024-10-10 23:36:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023621561] [2024-10-10 23:36:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-10 23:36:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023621561] [2024-10-10 23:36:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023621561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:36:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:36:33,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:36:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427909432] [2024-10-10 23:36:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:33,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:33,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:33,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:33,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:33,783 INFO L87 Difference]: Start difference. First operand 17401 states and 18174 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:34,629 INFO L93 Difference]: Finished difference Result 39007 states and 40844 transitions. [2024-10-10 23:36:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:34,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 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 870 [2024-10-10 23:36:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:34,652 INFO L225 Difference]: With dead ends: 39007 [2024-10-10 23:36:34,652 INFO L226 Difference]: Without dead ends: 21906 [2024-10-10 23:36:34,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:36:34,666 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 32 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:34,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 437 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:36:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21906 states. [2024-10-10 23:36:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21906 to 21007. [2024-10-10 23:36:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21007 states, 21006 states have (on average 1.0423688469960963) internal successors, (21896), 21006 states have internal predecessors, (21896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21007 states to 21007 states and 21896 transitions. [2024-10-10 23:36:34,888 INFO L78 Accepts]: Start accepts. Automaton has 21007 states and 21896 transitions. Word has length 870 [2024-10-10 23:36:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:34,889 INFO L471 AbstractCegarLoop]: Abstraction has 21007 states and 21896 transitions. [2024-10-10 23:36:34,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21007 states and 21896 transitions. [2024-10-10 23:36:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2024-10-10 23:36:34,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:34,902 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:36:34,902 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1064684106, now seen corresponding path program 1 times [2024-10-10 23:36:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373274350] [2024-10-10 23:36:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 255 proven. 1028 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-10 23:36:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:36:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373274350] [2024-10-10 23:36:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373274350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:36:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994970488] [2024-10-10 23:36:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:36:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:36:37,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:36:37,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:36:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:36:37,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:36:37,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:36:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 812 proven. 117 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-10-10 23:36:37,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:36:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-10-10 23:36:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994970488] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:36:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:36:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 10 [2024-10-10 23:36:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827296228] [2024-10-10 23:36:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:36:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:36:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:36:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:36:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:36:38,889 INFO L87 Difference]: Start difference. First operand 21007 states and 21896 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:36:39,701 INFO L93 Difference]: Finished difference Result 43510 states and 45321 transitions. [2024-10-10 23:36:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:36:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 882 [2024-10-10 23:36:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:36:39,724 INFO L225 Difference]: With dead ends: 43510 [2024-10-10 23:36:39,725 INFO L226 Difference]: Without dead ends: 22803 [2024-10-10 23:36:39,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1768 GetRequests, 1760 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:36:39,736 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 174 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:36:39,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 39 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:36:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22803 states. [2024-10-10 23:36:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22803 to 21605. [2024-10-10 23:36:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21605 states, 21604 states have (on average 1.0383725236067396) internal successors, (22433), 21604 states have internal predecessors, (22433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21605 states to 21605 states and 22433 transitions. [2024-10-10 23:36:39,901 INFO L78 Accepts]: Start accepts. Automaton has 21605 states and 22433 transitions. Word has length 882 [2024-10-10 23:36:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:36:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 21605 states and 22433 transitions. [2024-10-10 23:36:39,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:36:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 21605 states and 22433 transitions. [2024-10-10 23:36:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2024-10-10 23:36:39,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:36:39,914 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:36:39,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:36:40,114 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,SelfDestructingSolverStorable22 [2024-10-10 23:36:40,115 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:36:40,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:36:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1592515015, now seen corresponding path program 1 times [2024-10-10 23:36:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:36:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280003231] [2024-10-10 23:36:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:36:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:36:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat