./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/Problem16_label26.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/Problem16_label26.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 19a3ef648ea6e38f7d276220abc8bcbc6382e3dd9d7763e8b9d5f30e7cff149e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:41:41,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:41:41,222 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:41:41,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:41:41,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:41:41,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:41:41,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:41:41,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:41:41,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:41:41,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:41:41,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:41:41,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:41:41,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:41:41,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:41:41,253 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:41:41,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:41:41,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:41:41,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:41:41,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:41:41,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:41:41,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:41:41,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:41:41,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:41:41,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:41:41,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:41:41,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:41:41,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:41:41,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:41:41,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:41:41,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:41:41,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:41:41,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:41:41,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:41:41,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:41:41,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:41:41,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:41:41,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:41:41,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:41:41,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:41:41,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:41:41,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:41:41,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:41:41,263 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 -> 19a3ef648ea6e38f7d276220abc8bcbc6382e3dd9d7763e8b9d5f30e7cff149e [2024-10-10 23:41:41,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:41:41,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:41:41,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:41:41,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:41:41,538 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:41:41,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label26.c [2024-10-10 23:41:43,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:41:43,403 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:41:43,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label26.c [2024-10-10 23:41:43,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abdf500b9/2b8d002f6205479a8006dac718891e8f/FLAG97c328687 [2024-10-10 23:41:43,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abdf500b9/2b8d002f6205479a8006dac718891e8f [2024-10-10 23:41:43,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:41:43,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:41:43,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:41:43,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:41:43,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:41:43,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:41:43" (1/1) ... [2024-10-10 23:41:43,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416a87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:43, skipping insertion in model container [2024-10-10 23:41:43,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:41:43" (1/1) ... [2024-10-10 23:41:43,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:41:43,729 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/Problem16_label26.c[3798,3811] [2024-10-10 23:41:44,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:41:44,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:41:44,166 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/Problem16_label26.c[3798,3811] [2024-10-10 23:41:44,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:41:44,343 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:41:44,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44 WrapperNode [2024-10-10 23:41:44,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:41:44,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:41:44,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:41:44,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:41:44,354 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:41:44" (1/1) ... [2024-10-10 23:41:44,398 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:41:44" (1/1) ... [2024-10-10 23:41:44,503 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:41:44,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:41:44,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:41:44,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:41:44,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:41:44,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,663 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:41:44,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,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:41:44" (1/1) ... [2024-10-10 23:41:44,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:41:44,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:41:44,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:41:44,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:41:44,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (1/1) ... [2024-10-10 23:41:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:41:44,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:41:44,853 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:41:44,857 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:41:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:41:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:41:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:41:44,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:41:44,960 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:41:44,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:41:47,011 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:41:47,012 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:41:47,069 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:41:47,071 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:41:47,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:41:47 BoogieIcfgContainer [2024-10-10 23:41:47,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:41:47,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:41:47,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:41:47,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:41:47,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:41:43" (1/3) ... [2024-10-10 23:41:47,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f0ea7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:41:47, skipping insertion in model container [2024-10-10 23:41:47,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:44" (2/3) ... [2024-10-10 23:41:47,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f0ea7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:41:47, skipping insertion in model container [2024-10-10 23:41:47,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:41:47" (3/3) ... [2024-10-10 23:41:47,081 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label26.c [2024-10-10 23:41:47,099 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:41:47,100 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:41:47,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:41:47,175 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@140944de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:41:47,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:41:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:41:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 23:41:47,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:47,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:47,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -959518381, now seen corresponding path program 1 times [2024-10-10 23:41:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119133485] [2024-10-10 23:41:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119133485] [2024-10-10 23:41:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119133485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953177330] [2024-10-10 23:41:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:41:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:41:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:41:47,441 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:41:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:47,512 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:41:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:41:47,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-10 23:41:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:47,533 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:41:47,533 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:41:47,537 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:41:47,543 INFO L432 NwaCegarLoop]: 596 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, 596 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:41:47,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:41:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:41:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:41:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:41:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:41:47,617 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 34 [2024-10-10 23:41:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:47,617 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:41:47,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:41:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:41:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 23:41:47,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:47,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:47,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:41:47,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:47,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1679094621, now seen corresponding path program 1 times [2024-10-10 23:41:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:47,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911839387] [2024-10-10 23:41:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:47,820 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:41:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911839387] [2024-10-10 23:41:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911839387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:47,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130888239] [2024-10-10 23:41:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:47,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:47,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:47,826 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:41:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:49,415 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:41:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:49,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-10 23:41:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:49,422 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:41:49,422 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:41:49,424 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:41:49,425 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 336 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:49,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 199 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:41:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:41:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:41:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states 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:41:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2024-10-10 23:41:49,458 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 34 [2024-10-10 23:41:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2024-10-10 23:41:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:41:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2024-10-10 23:41:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-10 23:41:49,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:49,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:41:49,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1831914466, now seen corresponding path program 1 times [2024-10-10 23:41:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731084706] [2024-10-10 23:41:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:49,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731084706] [2024-10-10 23:41:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731084706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408985661] [2024-10-10 23:41:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:49,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:49,785 INFO L87 Difference]: Start difference. First operand 661 states and 1003 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:41:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:51,304 INFO L93 Difference]: Finished difference Result 1979 states and 3006 transitions. [2024-10-10 23:41:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:51,305 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 102 [2024-10-10 23:41:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:51,310 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:41:51,311 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:41:51,313 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:41:51,314 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:51,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 215 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:41:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:41:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:41:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.4559939301972686) internal successors, (1919), 1318 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states 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:41:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1919 transitions. [2024-10-10 23:41:51,363 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1919 transitions. Word has length 102 [2024-10-10 23:41:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:51,364 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1919 transitions. [2024-10-10 23:41:51,364 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:41:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1919 transitions. [2024-10-10 23:41:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 23:41:51,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:51,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:41:51,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:51,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash -50336253, now seen corresponding path program 1 times [2024-10-10 23:41:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620093095] [2024-10-10 23:41:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620093095] [2024-10-10 23:41:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620093095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:51,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851423924] [2024-10-10 23:41:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:51,564 INFO L87 Difference]: Start difference. First operand 1319 states and 1919 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:41:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:52,856 INFO L93 Difference]: Finished difference Result 3953 states and 5754 transitions. [2024-10-10 23:41:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-10 23:41:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:52,867 INFO L225 Difference]: With dead ends: 3953 [2024-10-10 23:41:52,867 INFO L226 Difference]: Without dead ends: 2635 [2024-10-10 23:41:52,870 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:41:52,871 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:52,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 153 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:41:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-10 23:41:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2024-10-10 23:41:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.3242217160212604) internal successors, (3488), 2634 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states 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:41:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3488 transitions. [2024-10-10 23:41:52,926 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3488 transitions. Word has length 113 [2024-10-10 23:41:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:52,929 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3488 transitions. [2024-10-10 23:41:52,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:41:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3488 transitions. [2024-10-10 23:41:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-10 23:41:52,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:52,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:41:52,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:41:52,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:52,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1860734725, now seen corresponding path program 1 times [2024-10-10 23:41:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:52,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281594719] [2024-10-10 23:41:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:52,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 23:41:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281594719] [2024-10-10 23:41:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281594719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:53,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848182818] [2024-10-10 23:41:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:53,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:53,221 INFO L87 Difference]: Start difference. First operand 2635 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:41:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:54,468 INFO L93 Difference]: Finished difference Result 6585 states and 8544 transitions. [2024-10-10 23:41:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:54,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 231 [2024-10-10 23:41:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:54,484 INFO L225 Difference]: With dead ends: 6585 [2024-10-10 23:41:54,484 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:41:54,489 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:41:54,491 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:54,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 82 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:41:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:41:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:41:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states 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:41:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-10 23:41:54,564 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 231 [2024-10-10 23:41:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:54,567 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-10 23:41:54,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:41:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-10 23:41:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-10 23:41:54,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:54,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:41:54,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:54,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash -831898430, now seen corresponding path program 1 times [2024-10-10 23:41:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253931364] [2024-10-10 23:41:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253931364] [2024-10-10 23:41:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253931364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:55,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441226749] [2024-10-10 23:41:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:55,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:41:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:55,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:41:55,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:41:55,278 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:41:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:56,654 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-10 23:41:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:41:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2024-10-10 23:41:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:56,674 INFO L225 Difference]: With dead ends: 8230 [2024-10-10 23:41:56,675 INFO L226 Difference]: Without dead ends: 4280 [2024-10-10 23:41:56,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:41:56,681 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:56,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:41:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-10 23:41:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-10 23:41:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states 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:41:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-10 23:41:56,754 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 279 [2024-10-10 23:41:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:56,754 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-10 23:41:56,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:41:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-10 23:41:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-10 23:41:56,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:56,762 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:41:56,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:41:56,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1606983880, now seen corresponding path program 1 times [2024-10-10 23:41:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474547266] [2024-10-10 23:41:56,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474547266] [2024-10-10 23:41:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474547266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:41:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111063552] [2024-10-10 23:41:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:41:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:41:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:41:57,444 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:41:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:59,393 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-10 23:41:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:41:59,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 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 366 [2024-10-10 23:41:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:59,407 INFO L225 Difference]: With dead ends: 8089 [2024-10-10 23:41:59,407 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:41:59,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:41:59,414 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 295 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:59,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 293 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:41:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:41:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:41:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states 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:41:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-10 23:41:59,475 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 366 [2024-10-10 23:41:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:59,476 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-10 23:41:59,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:41:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-10 23:41:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-10-10 23:41:59,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:59,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:41:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:41:59,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1254113368, now seen corresponding path program 1 times [2024-10-10 23:41:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451691851] [2024-10-10 23:41:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:41:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451691851] [2024-10-10 23:41:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451691851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627775510] [2024-10-10 23:41:59,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:59,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:59,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:59,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:59,857 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:42:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:00,825 INFO L93 Difference]: Finished difference Result 9217 states and 10059 transitions. [2024-10-10 23:42:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 373 [2024-10-10 23:42:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:00,842 INFO L225 Difference]: With dead ends: 9217 [2024-10-10 23:42:00,843 INFO L226 Difference]: Without dead ends: 5596 [2024-10-10 23:42:00,848 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:42:00,849 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:00,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 403 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:42:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-10 23:42:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-10 23:42:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0748882931188561) internal successors, (6014), 5595 states have internal predecessors, (6014), 0 states have call successors, (0), 0 states 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:42:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6014 transitions. [2024-10-10 23:42:00,934 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6014 transitions. Word has length 373 [2024-10-10 23:42:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:00,935 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6014 transitions. [2024-10-10 23:42:00,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:42:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6014 transitions. [2024-10-10 23:42:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-10 23:42:00,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:00,943 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:42:00,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:42:00,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:00,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1529000225, now seen corresponding path program 1 times [2024-10-10 23:42:00,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:00,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857935171] [2024-10-10 23:42:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857935171] [2024-10-10 23:42:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857935171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169367769] [2024-10-10 23:42:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:01,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:01,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:01,365 INFO L87 Difference]: Start difference. First operand 5596 states and 6014 transitions. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:42:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:02,113 INFO L93 Difference]: Finished difference Result 10862 states and 11696 transitions. [2024-10-10 23:42:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:02,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 428 [2024-10-10 23:42:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:02,131 INFO L225 Difference]: With dead ends: 10862 [2024-10-10 23:42:02,131 INFO L226 Difference]: Without dead ends: 5596 [2024-10-10 23:42:02,138 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:42:02,139 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 178 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:02,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 414 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-10 23:42:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-10 23:42:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0491510277033065) internal successors, (5870), 5595 states have internal predecessors, (5870), 0 states have call successors, (0), 0 states 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:42:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5870 transitions. [2024-10-10 23:42:02,219 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5870 transitions. Word has length 428 [2024-10-10 23:42:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5870 transitions. [2024-10-10 23:42:02,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:42:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5870 transitions. [2024-10-10 23:42:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-10-10 23:42:02,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:02,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:42:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:42:02,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1625174473, now seen corresponding path program 1 times [2024-10-10 23:42:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164496806] [2024-10-10 23:42:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164496806] [2024-10-10 23:42:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164496806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:02,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314568775] [2024-10-10 23:42:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:02,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:02,713 INFO L87 Difference]: Start difference. First operand 5596 states and 5870 transitions. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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:42:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:03,985 INFO L93 Difference]: Finished difference Result 16455 states and 17282 transitions. [2024-10-10 23:42:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:42:03,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 512 [2024-10-10 23:42:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:04,007 INFO L225 Difference]: With dead ends: 16455 [2024-10-10 23:42:04,007 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:42:04,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:04,017 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 192 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:04,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 95 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:42:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:42:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 9215. [2024-10-10 23:42:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0493813761667028) internal successors, (9669), 9214 states have internal predecessors, (9669), 0 states have call successors, (0), 0 states 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:42:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9669 transitions. [2024-10-10 23:42:04,213 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9669 transitions. Word has length 512 [2024-10-10 23:42:04,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9669 transitions. [2024-10-10 23:42:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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:42:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9669 transitions. [2024-10-10 23:42:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-10-10 23:42:04,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:04,220 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:42:04,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:42:04,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:04,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1097050080, now seen corresponding path program 1 times [2024-10-10 23:42:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909009493] [2024-10-10 23:42:04,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:42:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909009493] [2024-10-10 23:42:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909009493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187712540] [2024-10-10 23:42:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:04,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:04,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:04,545 INFO L87 Difference]: Start difference. First operand 9215 states and 9669 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:42:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:05,342 INFO L93 Difference]: Finished difference Result 21061 states and 22143 transitions. [2024-10-10 23:42:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:05,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 532 [2024-10-10 23:42:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:05,364 INFO L225 Difference]: With dead ends: 21061 [2024-10-10 23:42:05,364 INFO L226 Difference]: Without dead ends: 12176 [2024-10-10 23:42:05,374 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:42:05,375 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:05,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 36 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2024-10-10 23:42:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 11518. [2024-10-10 23:42:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 11517 states have (on average 1.046800382043935) internal successors, (12056), 11517 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states 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:42:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 12056 transitions. [2024-10-10 23:42:05,525 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 12056 transitions. Word has length 532 [2024-10-10 23:42:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:05,526 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 12056 transitions. [2024-10-10 23:42:05,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:42:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 12056 transitions. [2024-10-10 23:42:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2024-10-10 23:42:05,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:05,533 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:05,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:42:05,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:05,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1846719737, now seen corresponding path program 1 times [2024-10-10 23:42:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2441858] [2024-10-10 23:42:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 382 proven. 156 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 23:42:06,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2441858] [2024-10-10 23:42:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2441858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:42:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326478566] [2024-10-10 23:42:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:06,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:06,922 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:42:06,923 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:42:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:07,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:42:07,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:42:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-10 23:42:07,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:42:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326478566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:07,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:42:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:42:07,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360056019] [2024-10-10 23:42:07,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:07,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:07,405 INFO L87 Difference]: Start difference. First operand 11518 states and 12056 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:42:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:08,294 INFO L93 Difference]: Finished difference Result 25667 states and 26945 transitions. [2024-10-10 23:42:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 586 [2024-10-10 23:42:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:08,318 INFO L225 Difference]: With dead ends: 25667 [2024-10-10 23:42:08,318 INFO L226 Difference]: Without dead ends: 14479 [2024-10-10 23:42:08,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:08,330 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:08,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 439 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:42:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2024-10-10 23:42:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 13821. [2024-10-10 23:42:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.045151953690304) internal successors, (14444), 13820 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states 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:42:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14444 transitions. [2024-10-10 23:42:08,494 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14444 transitions. Word has length 586 [2024-10-10 23:42:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:08,495 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14444 transitions. [2024-10-10 23:42:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:42:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14444 transitions. [2024-10-10 23:42:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2024-10-10 23:42:08,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:08,503 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:42:08,520 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:42:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:42:08,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2005367155, now seen corresponding path program 1 times [2024-10-10 23:42:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820961231] [2024-10-10 23:42:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-10 23:42:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820961231] [2024-10-10 23:42:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820961231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640686694] [2024-10-10 23:42:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:09,278 INFO L87 Difference]: Start difference. First operand 13821 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:42:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:10,034 INFO L93 Difference]: Finished difference Result 27312 states and 28556 transitions. [2024-10-10 23:42:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 647 [2024-10-10 23:42:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:10,053 INFO L225 Difference]: With dead ends: 27312 [2024-10-10 23:42:10,054 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:42:10,068 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:42:10,068 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 312 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:10,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 424 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:42:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 12834. [2024-10-10 23:42:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0424686355489754) internal successors, (13378), 12833 states have internal predecessors, (13378), 0 states have call successors, (0), 0 states 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:42:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13378 transitions. [2024-10-10 23:42:10,215 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13378 transitions. Word has length 647 [2024-10-10 23:42:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:10,215 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13378 transitions. [2024-10-10 23:42:10,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:42:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13378 transitions. [2024-10-10 23:42:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2024-10-10 23:42:10,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:10,229 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:42:10,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:42:10,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:10,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1310537061, now seen corresponding path program 1 times [2024-10-10 23:42:10,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:10,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183013973] [2024-10-10 23:42:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-10-10 23:42:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:11,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183013973] [2024-10-10 23:42:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183013973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:11,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142472570] [2024-10-10 23:42:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:11,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:11,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:11,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:11,401 INFO L87 Difference]: Start difference. First operand 12834 states and 13378 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:42:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:12,109 INFO L93 Difference]: Finished difference Result 25338 states and 26424 transitions. [2024-10-10 23:42:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 845 [2024-10-10 23:42:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:12,131 INFO L225 Difference]: With dead ends: 25338 [2024-10-10 23:42:12,132 INFO L226 Difference]: Without dead ends: 12834 [2024-10-10 23:42:12,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:42:12,143 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 332 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:12,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 374 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2024-10-10 23:42:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12834. [2024-10-10 23:42:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.036312631496922) internal successors, (13299), 12833 states have internal predecessors, (13299), 0 states have call successors, (0), 0 states 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:42:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13299 transitions. [2024-10-10 23:42:12,293 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13299 transitions. Word has length 845 [2024-10-10 23:42:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:12,294 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13299 transitions. [2024-10-10 23:42:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:42:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13299 transitions. [2024-10-10 23:42:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-10-10 23:42:12,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:12,308 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:42:12,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:42:12,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:12,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1176938166, now seen corresponding path program 1 times [2024-10-10 23:42:12,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:12,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980259029] [2024-10-10 23:42:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2024-10-10 23:42:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980259029] [2024-10-10 23:42:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980259029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146163624] [2024-10-10 23:42:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:12,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:12,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:12,879 INFO L87 Difference]: Start difference. First operand 12834 states and 13299 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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:42:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:13,619 INFO L93 Difference]: Finished difference Result 30273 states and 31425 transitions. [2024-10-10 23:42:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 862 [2024-10-10 23:42:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:13,641 INFO L225 Difference]: With dead ends: 30273 [2024-10-10 23:42:13,642 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:42:13,655 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:42:13,656 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 269 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:13,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 427 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:42:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 15795. [2024-10-10 23:42:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15795 states, 15794 states have (on average 1.0291249841712042) internal successors, (16254), 15794 states have internal predecessors, (16254), 0 states have call successors, (0), 0 states 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:42:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15795 states to 15795 states and 16254 transitions. [2024-10-10 23:42:13,969 INFO L78 Accepts]: Start accepts. Automaton has 15795 states and 16254 transitions. Word has length 862 [2024-10-10 23:42:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:13,970 INFO L471 AbstractCegarLoop]: Abstraction has 15795 states and 16254 transitions. [2024-10-10 23:42:13,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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:42:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 15795 states and 16254 transitions. [2024-10-10 23:42:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2024-10-10 23:42:13,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:13,989 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:42:13,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:42:13,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 741467040, now seen corresponding path program 1 times [2024-10-10 23:42:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191847867] [2024-10-10 23:42:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 1730 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-10 23:42:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191847867] [2024-10-10 23:42:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191847867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:14,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:14,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413254927] [2024-10-10 23:42:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:14,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:14,735 INFO L87 Difference]: Start difference. First operand 15795 states and 16254 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:42:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:15,458 INFO L93 Difference]: Finished difference Result 31260 states and 32176 transitions. [2024-10-10 23:42:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 1118 [2024-10-10 23:42:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:15,482 INFO L225 Difference]: With dead ends: 31260 [2024-10-10 23:42:15,482 INFO L226 Difference]: Without dead ends: 15795 [2024-10-10 23:42:15,497 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:42:15,501 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:15,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 426 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2024-10-10 23:42:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 14479. [2024-10-10 23:42:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.0232766956761983) internal successors, (14815), 14478 states have internal predecessors, (14815), 0 states have call successors, (0), 0 states 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:42:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14815 transitions. [2024-10-10 23:42:15,723 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14815 transitions. Word has length 1118 [2024-10-10 23:42:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:15,724 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14815 transitions. [2024-10-10 23:42:15,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:42:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14815 transitions. [2024-10-10 23:42:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2024-10-10 23:42:15,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:15,753 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:42:15,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:42:15,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:15,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash 303020665, now seen corresponding path program 1 times [2024-10-10 23:42:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:15,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577770798] [2024-10-10 23:42:15,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2448 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-10 23:42:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:16,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577770798] [2024-10-10 23:42:16,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577770798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:16,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:16,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734353474] [2024-10-10 23:42:16,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:16,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:16,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:16,544 INFO L87 Difference]: Start difference. First operand 14479 states and 14815 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:42:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:17,301 INFO L93 Difference]: Finished difference Result 31918 states and 32698 transitions. [2024-10-10 23:42:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:17,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 1119 [2024-10-10 23:42:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:17,314 INFO L225 Difference]: With dead ends: 31918 [2024-10-10 23:42:17,315 INFO L226 Difference]: Without dead ends: 15466 [2024-10-10 23:42:17,325 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:42:17,325 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 274 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:17,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 408 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-10 23:42:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 12834. [2024-10-10 23:42:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.020182342398504) internal successors, (13092), 12833 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states 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:42:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13092 transitions. [2024-10-10 23:42:17,473 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13092 transitions. Word has length 1119 [2024-10-10 23:42:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13092 transitions. [2024-10-10 23:42:17,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:42:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13092 transitions. [2024-10-10 23:42:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2024-10-10 23:42:17,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:17,495 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:42:17,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:42:17,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:17,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash 995704439, now seen corresponding path program 1 times [2024-10-10 23:42:17,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402880590] [2024-10-10 23:42:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3942 backedges. 2413 proven. 0 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2024-10-10 23:42:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402880590] [2024-10-10 23:42:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402880590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363410789] [2024-10-10 23:42:18,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:18,597 INFO L87 Difference]: Start difference. First operand 12834 states and 13092 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:42:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:19,263 INFO L93 Difference]: Finished difference Result 25996 states and 26518 transitions. [2024-10-10 23:42:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1374 [2024-10-10 23:42:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:19,274 INFO L225 Difference]: With dead ends: 25996 [2024-10-10 23:42:19,275 INFO L226 Difference]: Without dead ends: 13492 [2024-10-10 23:42:19,283 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:42:19,283 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:19,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 427 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2024-10-10 23:42:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13492. [2024-10-10 23:42:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0194944778000148) internal successors, (13754), 13491 states have internal predecessors, (13754), 0 states have call successors, (0), 0 states 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:42:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13754 transitions. [2024-10-10 23:42:19,408 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13754 transitions. Word has length 1374 [2024-10-10 23:42:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13754 transitions. [2024-10-10 23:42:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:42:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13754 transitions. [2024-10-10 23:42:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1413 [2024-10-10 23:42:19,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:19,432 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:42:19,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:42:19,432 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:19,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1091047601, now seen corresponding path program 1 times [2024-10-10 23:42:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:19,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73814510] [2024-10-10 23:42:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3703 backedges. 2644 proven. 0 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-10 23:42:20,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:20,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73814510] [2024-10-10 23:42:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73814510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:20,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:42:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877699004] [2024-10-10 23:42:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:20,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:42:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:42:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:42:20,974 INFO L87 Difference]: Start difference. First operand 13492 states and 13754 transitions. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:42:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:22,030 INFO L93 Difference]: Finished difference Result 26655 states and 27177 transitions. [2024-10-10 23:42:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:42:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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 1412 [2024-10-10 23:42:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:22,046 INFO L225 Difference]: With dead ends: 26655 [2024-10-10 23:42:22,047 INFO L226 Difference]: Without dead ends: 13493 [2024-10-10 23:42:22,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:22,056 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 357 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:22,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 550 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:42:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2024-10-10 23:42:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13492. [2024-10-10 23:42:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0191979838410792) internal successors, (13750), 13491 states have internal predecessors, (13750), 0 states have call successors, (0), 0 states 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:42:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13750 transitions. [2024-10-10 23:42:22,154 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13750 transitions. Word has length 1412 [2024-10-10 23:42:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:22,155 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13750 transitions. [2024-10-10 23:42:22,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:42:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13750 transitions. [2024-10-10 23:42:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1427 [2024-10-10 23:42:22,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:22,171 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2024-10-10 23:42:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:42:22,172 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -586444025, now seen corresponding path program 1 times [2024-10-10 23:42:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:22,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701769668] [2024-10-10 23:42:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3584 backedges. 2562 proven. 0 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2024-10-10 23:42:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701769668] [2024-10-10 23:42:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701769668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:23,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:42:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511095249] [2024-10-10 23:42:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:23,485 INFO L87 Difference]: Start difference. First operand 13492 states and 13750 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:42:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:24,423 INFO L93 Difference]: Finished difference Result 26664 states and 27178 transitions. [2024-10-10 23:42:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:42:24,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1426 [2024-10-10 23:42:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:24,435 INFO L225 Difference]: With dead ends: 26664 [2024-10-10 23:42:24,436 INFO L226 Difference]: Without dead ends: 13502 [2024-10-10 23:42:24,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:42:24,444 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:24,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 432 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:42:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13502 states. [2024-10-10 23:42:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13502 to 13492. [2024-10-10 23:42:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0189014898821436) internal successors, (13746), 13491 states have internal predecessors, (13746), 0 states have call successors, (0), 0 states 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:42:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13746 transitions. [2024-10-10 23:42:24,539 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13746 transitions. Word has length 1426 [2024-10-10 23:42:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:24,539 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13746 transitions. [2024-10-10 23:42:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:42:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13746 transitions. [2024-10-10 23:42:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2024-10-10 23:42:24,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:24,554 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:24,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:42:24,554 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:24,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1671274256, now seen corresponding path program 1 times [2024-10-10 23:42:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031318621] [2024-10-10 23:42:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3937 backedges. 1190 proven. 19 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2024-10-10 23:42:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031318621] [2024-10-10 23:42:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031318621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:42:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098744353] [2024-10-10 23:42:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:25,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:25,332 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:42:25,333 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:42:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:25,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:42:25,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:42:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3937 backedges. 1176 proven. 0 refuted. 0 times theorem prover too weak. 2761 trivial. 0 not checked. [2024-10-10 23:42:26,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:42:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098744353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:42:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:42:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855989799] [2024-10-10 23:42:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:26,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:42:26,108 INFO L87 Difference]: Start difference. First operand 13492 states and 13746 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:42:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:26,821 INFO L93 Difference]: Finished difference Result 26652 states and 27159 transitions. [2024-10-10 23:42:26,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:26,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 1428 [2024-10-10 23:42:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:26,823 INFO L225 Difference]: With dead ends: 26652 [2024-10-10 23:42:26,823 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:42:26,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1428 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:42:26,831 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 191 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:26,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 47 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:42:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:42:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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:42:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:42:26,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1428 [2024-10-10 23:42:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:26,833 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:42:26,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:42:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:42:26,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:42:26,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:42:26,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:42:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:27,039 INFO L407 BasicCegarLoop]: Path program histogram: [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:42:27,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:42:28,141 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:42:28,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:42:28 BoogieIcfgContainer [2024-10-10 23:42:28,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:42:28,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:42:28,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:42:28,164 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:42:28,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:41:47" (3/4) ... [2024-10-10 23:42:28,167 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:42:28,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:42:28,194 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:42:28,195 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:42:28,197 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:42:28,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:42:28,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:42:28,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:42:28,399 INFO L158 Benchmark]: Toolchain (without parser) took 44954.37ms. Allocated memory was 161.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 88.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 570.0MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,399 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:42:28,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 898.86ms. Allocated memory is still 161.5MB. Free memory was 88.0MB in the beginning and 85.3MB in the end (delta: 2.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 159.07ms. Allocated memory is still 161.5MB. Free memory was 85.3MB in the beginning and 60.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,400 INFO L158 Benchmark]: Boogie Preprocessor took 312.22ms. Allocated memory is still 161.5MB. Free memory was 60.9MB in the beginning and 108.9MB in the end (delta: -48.0MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,400 INFO L158 Benchmark]: RCFGBuilder took 2253.84ms. Allocated memory was 161.5MB in the beginning and 253.8MB in the end (delta: 92.3MB). Free memory was 108.8MB in the beginning and 155.3MB in the end (delta: -46.5MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,400 INFO L158 Benchmark]: TraceAbstraction took 41089.26ms. Allocated memory was 253.8MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 154.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 517.0MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,400 INFO L158 Benchmark]: Witness Printer took 234.02ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:42:28,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 898.86ms. Allocated memory is still 161.5MB. Free memory was 88.0MB in the beginning and 85.3MB in the end (delta: 2.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 159.07ms. Allocated memory is still 161.5MB. Free memory was 85.3MB in the beginning and 60.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 312.22ms. Allocated memory is still 161.5MB. Free memory was 60.9MB in the beginning and 108.9MB in the end (delta: -48.0MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2253.84ms. Allocated memory was 161.5MB in the beginning and 253.8MB in the end (delta: 92.3MB). Free memory was 108.8MB in the beginning and 155.3MB in the end (delta: -46.5MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41089.26ms. Allocated memory was 253.8MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 154.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 517.0MB. Max. memory is 16.1GB. * Witness Printer took 234.02ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 122]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.9s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5100 SdHoareTripleChecker+Valid, 19.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5100 mSDsluCounter, 6758 SdHoareTripleChecker+Invalid, 15.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 2453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20262 IncrementalHoareTripleChecker+Invalid, 22715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2453 mSolverCounterUnsat, 6454 mSDtfsCounter, 20262 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2089 GetRequests, 2049 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15795occurred in iteration=15, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 8565 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 15835 NumberOfCodeBlocks, 15835 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 15812 ConstructedInterpolants, 0 QuantifiedInterpolants, 34744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2355 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 29216/29391 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a16 == 8) && (5 == a12)) && (a15 == 3)) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || (((a16 == 8) && (a15 <= 3)) && (7 == a12))) || (((a16 == 9) && (a15 <= 3)) && (9 <= a12))) || ((((a15 <= 3) && (a12 == 8)) && (10 <= a16)) && (a16 <= 11))) || ((a16 == 8) && (a12 == 6))) || ((a16 == 9) && (a15 != 3))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6)) && (a16 == 12))) || (((a16 == 9) && (a15 <= 3)) && (7 == a12))) || ((((a12 <= 5) && (10 <= a16)) && (a15 != 3)) && (a16 <= 11))) || ((a16 == 9) && (5 == a12))) || ((((a16 == 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a15 != 3))) || ((a16 == 9) && (a12 == 8))) || (((a15 <= 3) && (a16 == 12)) && (9 <= a12))) || (((10 <= a16) && (a12 == 6)) && (a16 <= 11))) || ((((a15 <= 3) && (10 <= a16)) && (9 <= a12)) && (a16 <= 11))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || ((((a15 <= 3) && (10 <= a16)) && (a16 <= 11)) && (7 == a12))) || (((a16 == 8) && (a15 == 4)) && (5 == a12))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || (((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a12 == 8))) || ((((0 <= ((long long) 87 + a18)) && (10 <= a16)) && (5 == a12)) && (a16 <= 11))) || ((a16 == 8) && (9 <= a12))) || (((a16 == 12) && (5 == a12)) && (a15 == 3))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:42:28,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE