./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_label25.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_label25.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 b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:41:35,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:41:35,741 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:35,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:41:35,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:41:35,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:41:35,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:41:35,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:41:35,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:41:35,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:41:35,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:41:35,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:41:35,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:41:35,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:41:35,775 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:41:35,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:41:35,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:41:35,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:41:35,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:41:35,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:41:35,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:41:35,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:41:35,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:41:35,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:41:35,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:41:35,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:41:35,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:41:35,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:41:35,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:41:35,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:41:35,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:41:35,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:41:35,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:41:35,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:41:35,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:41:35,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:41:35,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:41:35,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:41:35,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:41:35,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:41:35,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:41:35,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:41:35,788 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 -> b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 [2024-10-10 23:41:36,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:41:36,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:41:36,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:41:36,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:41:36,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:41:36,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-10-10 23:41:37,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:41:37,861 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:41:37,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-10-10 23:41:37,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4552870d7/b800ad4279104769b4be23744b210f03/FLAGe44305fa5 [2024-10-10 23:41:37,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4552870d7/b800ad4279104769b4be23744b210f03 [2024-10-10 23:41:37,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:41:37,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:41:37,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:41:37,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:41:37,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:41:37,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:41:37" (1/1) ... [2024-10-10 23:41:37,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fffcb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:37, skipping insertion in model container [2024-10-10 23:41:37,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:41:37" (1/1) ... [2024-10-10 23:41:37,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:41:38,263 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_label25.c[5318,5331] [2024-10-10 23:41:38,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:41:38,577 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:41:38,605 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_label25.c[5318,5331] [2024-10-10 23:41:38,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:41:38,829 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:41:38,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:38 WrapperNode [2024-10-10 23:41:38,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:41:38,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:41:38,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:41:38,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:41:38,838 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:38" (1/1) ... [2024-10-10 23:41:38,881 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:38" (1/1) ... [2024-10-10 23:41:38,999 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:41:39,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:41:39,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:41:39,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:41:39,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:41:39,011 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:38" (1/1) ... [2024-10-10 23:41:39,011 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:38" (1/1) ... [2024-10-10 23:41:39,025 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:38" (1/1) ... [2024-10-10 23:41:39,139 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:39,140 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:38" (1/1) ... [2024-10-10 23:41:39,140 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:38" (1/1) ... [2024-10-10 23:41:39,260 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:38" (1/1) ... [2024-10-10 23:41:39,286 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:38" (1/1) ... [2024-10-10 23:41:39,318 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:38" (1/1) ... [2024-10-10 23:41:39,333 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:38" (1/1) ... [2024-10-10 23:41:39,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:41:39,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:41:39,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:41:39,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:41:39,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:38" (1/1) ... [2024-10-10 23:41:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:41:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:41:39,432 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:39,434 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:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:41:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:41:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:41:39,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:41:39,535 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:41:39,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:41:41,602 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:41:41,602 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:41:41,668 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:41:41,672 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:41:41,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:41:41 BoogieIcfgContainer [2024-10-10 23:41:41,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:41:41,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:41:41,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:41:41,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:41:41,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:41:37" (1/3) ... [2024-10-10 23:41:41,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e12840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:41:41, skipping insertion in model container [2024-10-10 23:41:41,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:41:38" (2/3) ... [2024-10-10 23:41:41,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e12840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:41:41, skipping insertion in model container [2024-10-10 23:41:41,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:41:41" (3/3) ... [2024-10-10 23:41:41,683 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label25.c [2024-10-10 23:41:41,699 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:41:41,700 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:41:41,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:41:41,772 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;@577a72ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:41:41,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:41:41,779 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:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 23:41:41,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:41,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:41,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1596310217, now seen corresponding path program 1 times [2024-10-10 23:41:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:41,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803640108] [2024-10-10 23:41:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:42,002 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:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803640108] [2024-10-10 23:41:42,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803640108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:42,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:42,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489369773] [2024-10-10 23:41:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:42,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:41:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:41:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:41:42,049 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:42,120 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:41:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:41:42,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-10 23:41:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:42,141 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:41:42,141 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:41:42,145 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:42,151 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:42,152 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:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:41:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:41:42,199 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:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:41:42,205 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 49 [2024-10-10 23:41:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:42,205 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:41:42,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:41:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 23:41:42,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:42,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:42,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:41:42,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:42,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2111666783, now seen corresponding path program 1 times [2024-10-10 23:41:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:42,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293532601] [2024-10-10 23:41:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:42,422 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:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293532601] [2024-10-10 23:41:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293532601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:42,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:42,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559284457] [2024-10-10 23:41:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:42,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:42,428 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:44,082 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:41:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-10 23:41:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:44,088 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:41:44,088 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:41:44,089 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:44,091 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:44,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:41:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:41:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:41:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have 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:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-10 23:41:44,134 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 49 [2024-10-10 23:41:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:44,135 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-10 23:41:44,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-10 23:41:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:41:44,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:44,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:41:44,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1420260030, now seen corresponding path program 1 times [2024-10-10 23:41:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014537435] [2024-10-10 23:41:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:44,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014537435] [2024-10-10 23:41:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014537435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720177371] [2024-10-10 23:41:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:44,325 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:45,598 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-10 23:41:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:45,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-10 23:41:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:45,604 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:41:45,604 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:41:45,606 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:45,607 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:45,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:41:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:41:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:41:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have 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:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-10 23:41:45,638 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 115 [2024-10-10 23:41:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:45,639 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-10 23:41:45,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-10 23:41:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 23:41:45,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:45,643 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:45,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:41:45,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:45,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1662130166, now seen corresponding path program 1 times [2024-10-10 23:41:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853528562] [2024-10-10 23:41:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853528562] [2024-10-10 23:41:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853528562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386845875] [2024-10-10 23:41:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:45,841 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:47,105 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-10 23:41:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-10 23:41:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:47,112 INFO L225 Difference]: With dead ends: 3295 [2024-10-10 23:41:47,113 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:41:47,114 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:47,115 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:47,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:41:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:41:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:41:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have 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,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-10 23:41:47,148 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 116 [2024-10-10 23:41:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:47,149 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-10 23:41:47,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-10 23:41:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-10 23:41:47,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:47,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:41:47,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1731941104, now seen corresponding path program 1 times [2024-10-10 23:41:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586387469] [2024-10-10 23:41:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586387469] [2024-10-10 23:41:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586387469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:47,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:41:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981847019] [2024-10-10 23:41:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:47,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:47,362 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have 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:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:48,560 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-10 23:41:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-10-10 23:41:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:48,574 INFO L225 Difference]: With dead ends: 5927 [2024-10-10 23:41:48,574 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:41:48,577 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:48,578 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:48,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:41:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:41:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:41:48,642 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:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-10 23:41:48,649 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 208 [2024-10-10 23:41:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:48,651 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-10 23:41:48,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have 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:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-10 23:41:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-10 23:41:48,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:48,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:41:48,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1367546169, now seen corresponding path program 1 times [2024-10-10 23:41:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465017921] [2024-10-10 23:41:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465017921] [2024-10-10 23:41:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465017921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761129782] [2024-10-10 23:41:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:41:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:41:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:41:49,305 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:50,464 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-10 23:41:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:41:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2024-10-10 23:41:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:50,479 INFO L225 Difference]: With dead ends: 8230 [2024-10-10 23:41:50,479 INFO L226 Difference]: Without dead ends: 4280 [2024-10-10 23:41:50,484 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:50,485 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:50,485 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.1s Time] [2024-10-10 23:41:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-10 23:41:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-10 23:41:50,567 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:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-10 23:41:50,580 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 294 [2024-10-10 23:41:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:50,581 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-10 23:41:50,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-10 23:41:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-10 23:41:50,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:50,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:50,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:41:50,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:50,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1985964300, now seen corresponding path program 1 times [2024-10-10 23:41:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313006261] [2024-10-10 23:41:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313006261] [2024-10-10 23:41:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313006261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:41:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365455662] [2024-10-10 23:41:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:41:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:41:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:41:51,245 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:53,000 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-10 23:41:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:41:53,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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 381 [2024-10-10 23:41:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:53,013 INFO L225 Difference]: With dead ends: 8089 [2024-10-10 23:41:53,013 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:41:53,018 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:53,019 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:53,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:41:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:41:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:41:53,066 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:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-10 23:41:53,072 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 381 [2024-10-10 23:41:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-10 23:41:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-10 23:41:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-10 23:41:53,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:53,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:41:53,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:53,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash -599706958, now seen corresponding path program 1 times [2024-10-10 23:41:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675888818] [2024-10-10 23:41:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:41:53,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675888818] [2024-10-10 23:41:53,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675888818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:53,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:53,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:53,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535955707] [2024-10-10 23:41:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:53,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:53,393 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:54,315 INFO L93 Difference]: Finished difference Result 9217 states and 10059 transitions. [2024-10-10 23:41:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:54,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 388 [2024-10-10 23:41:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:54,332 INFO L225 Difference]: With dead ends: 9217 [2024-10-10 23:41:54,333 INFO L226 Difference]: Without dead ends: 5596 [2024-10-10 23:41:54,338 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:41:54,339 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 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:41:54,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 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:41:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-10 23:41:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-10 23:41:54,414 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:41:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6014 transitions. [2024-10-10 23:41:54,428 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6014 transitions. Word has length 388 [2024-10-10 23:41:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6014 transitions. [2024-10-10 23:41:54,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6014 transitions. [2024-10-10 23:41:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-10 23:41:54,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:54,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:41:54,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1553494339, now seen corresponding path program 1 times [2024-10-10 23:41:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547371390] [2024-10-10 23:41:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547371390] [2024-10-10 23:41:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547371390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:54,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768523925] [2024-10-10 23:41:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:54,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:54,830 INFO L87 Difference]: Start difference. First operand 5596 states and 6014 transitions. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:55,739 INFO L93 Difference]: Finished difference Result 10862 states and 11696 transitions. [2024-10-10 23:41:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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 443 [2024-10-10 23:41:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:55,753 INFO L225 Difference]: With dead ends: 10862 [2024-10-10 23:41:55,753 INFO L226 Difference]: Without dead ends: 5596 [2024-10-10 23:41:55,758 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:41:55,759 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 178 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:55,759 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.9s Time] [2024-10-10 23:41:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-10 23:41:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-10 23:41:55,837 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:41:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5870 transitions. [2024-10-10 23:41:55,846 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5870 transitions. Word has length 443 [2024-10-10 23:41:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5870 transitions. [2024-10-10 23:41:55,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5870 transitions. [2024-10-10 23:41:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-10-10 23:41:55,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:55,860 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:55,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:41:55,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1485346541, now seen corresponding path program 1 times [2024-10-10 23:41:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320989717] [2024-10-10 23:41:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:41:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320989717] [2024-10-10 23:41:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320989717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370824465] [2024-10-10 23:41:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:56,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:41:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:41:56,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:41:56,327 INFO L87 Difference]: Start difference. First operand 5596 states and 5870 transitions. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have 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:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:57,688 INFO L93 Difference]: Finished difference Result 16457 states and 17283 transitions. [2024-10-10 23:41:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:41:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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 527 [2024-10-10 23:41:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:57,713 INFO L225 Difference]: With dead ends: 16457 [2024-10-10 23:41:57,714 INFO L226 Difference]: Without dead ends: 11191 [2024-10-10 23:41:57,720 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:41:57,721 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:57,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 96 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:41:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11191 states. [2024-10-10 23:41:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11191 to 9215. [2024-10-10 23:41:57,830 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:41:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9669 transitions. [2024-10-10 23:41:57,842 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9669 transitions. Word has length 527 [2024-10-10 23:41:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9669 transitions. [2024-10-10 23:41:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have 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:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9669 transitions. [2024-10-10 23:41:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-10-10 23:41:57,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:57,848 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:41:57,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:41:57,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:57,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1490232739, now seen corresponding path program 1 times [2024-10-10 23:41:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046994283] [2024-10-10 23:41:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:57,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:41:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046994283] [2024-10-10 23:41:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046994283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:58,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337679553] [2024-10-10 23:41:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:58,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:58,256 INFO L87 Difference]: Start difference. First operand 9215 states and 9669 transitions. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have 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,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:59,009 INFO L93 Difference]: Finished difference Result 21061 states and 22143 transitions. [2024-10-10 23:41:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:59,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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 547 [2024-10-10 23:41:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:59,028 INFO L225 Difference]: With dead ends: 21061 [2024-10-10 23:41:59,029 INFO L226 Difference]: Without dead ends: 12176 [2024-10-10 23:41:59,039 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:41:59,040 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:41:59,040 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:41:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2024-10-10 23:41:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 11518. [2024-10-10 23:41:59,156 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:41:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 12056 transitions. [2024-10-10 23:41:59,169 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 12056 transitions. Word has length 547 [2024-10-10 23:41:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:59,170 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 12056 transitions. [2024-10-10 23:41:59,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have 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,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 12056 transitions. [2024-10-10 23:41:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-10-10 23:41:59,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:59,176 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:41:59,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:41:59,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:59,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -527319900, now seen corresponding path program 1 times [2024-10-10 23:41:59,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:59,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376952984] [2024-10-10 23:41:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-10 23:42:00,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:00,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376952984] [2024-10-10 23:42:00,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376952984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:00,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604435370] [2024-10-10 23:42:00,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:00,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:00,030 INFO L87 Difference]: Start difference. First operand 11518 states and 12056 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have 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,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:00,836 INFO L93 Difference]: Finished difference Result 23035 states and 24114 transitions. [2024-10-10 23:42:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 601 [2024-10-10 23:42:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:00,855 INFO L225 Difference]: With dead ends: 23035 [2024-10-10 23:42:00,855 INFO L226 Difference]: Without dead ends: 11847 [2024-10-10 23:42:00,867 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:00,868 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:00,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 116 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:42:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2024-10-10 23:42:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 11847. [2024-10-10 23:42:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.0456694242782374) internal successors, (12387), 11846 states have internal predecessors, (12387), 0 states have call successors, (0), 0 states have 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:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 12387 transitions. [2024-10-10 23:42:01,009 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 12387 transitions. Word has length 601 [2024-10-10 23:42:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:01,010 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 12387 transitions. [2024-10-10 23:42:01,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have 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:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 12387 transitions. [2024-10-10 23:42:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2024-10-10 23:42:01,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:01,017 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:42:01,017 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1914747960, now seen corresponding path program 1 times [2024-10-10 23:42:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18618714] [2024-10-10 23:42:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-10 23:42:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18618714] [2024-10-10 23:42:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18618714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:01,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117795017] [2024-10-10 23:42:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:01,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:01,475 INFO L87 Difference]: Start difference. First operand 11847 states and 12387 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:02,159 INFO L93 Difference]: Finished difference Result 23035 states and 24111 transitions. [2024-10-10 23:42:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 662 [2024-10-10 23:42:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:02,182 INFO L225 Difference]: With dead ends: 23035 [2024-10-10 23:42:02,182 INFO L226 Difference]: Without dead ends: 11847 [2024-10-10 23:42:02,194 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,195 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 297 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 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.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:02,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 424 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2024-10-10 23:42:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 10860. [2024-10-10 23:42:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0427295331061792) internal successors, (11323), 10859 states have internal predecessors, (11323), 0 states have call successors, (0), 0 states have 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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11323 transitions. [2024-10-10 23:42:02,394 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11323 transitions. Word has length 662 [2024-10-10 23:42:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:02,395 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11323 transitions. [2024-10-10 23:42:02,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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,396 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11323 transitions. [2024-10-10 23:42:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-10-10 23:42:02,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:02,409 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:02,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:42:02,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:02,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1349136587, now seen corresponding path program 1 times [2024-10-10 23:42:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:02,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657766041] [2024-10-10 23:42:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-10-10 23:42:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:02,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657766041] [2024-10-10 23:42:02,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657766041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:02,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633783015] [2024-10-10 23:42:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:02,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:02,999 INFO L87 Difference]: Start difference. First operand 10860 states and 11323 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:03,784 INFO L93 Difference]: Finished difference Result 24022 states and 25130 transitions. [2024-10-10 23:42:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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 851 [2024-10-10 23:42:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:03,803 INFO L225 Difference]: With dead ends: 24022 [2024-10-10 23:42:03,804 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:42:03,814 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:03,815 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:03,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 440 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:42:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13163. [2024-10-10 23:42:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0415590335815226) internal successors, (13709), 13162 states have internal predecessors, (13709), 0 states have call successors, (0), 0 states have 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,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13709 transitions. [2024-10-10 23:42:03,983 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13709 transitions. Word has length 851 [2024-10-10 23:42:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:03,984 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13709 transitions. [2024-10-10 23:42:03,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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,984 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13709 transitions. [2024-10-10 23:42:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2024-10-10 23:42:03,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:03,998 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:03,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:42:03,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1161171519, now seen corresponding path program 1 times [2024-10-10 23:42:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880627477] [2024-10-10 23:42:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-10-10 23:42:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880627477] [2024-10-10 23:42:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880627477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356035979] [2024-10-10 23:42:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:04,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:04,780 INFO L87 Difference]: Start difference. First operand 13163 states and 13709 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:05,507 INFO L93 Difference]: Finished difference Result 30602 states and 31961 transitions. [2024-10-10 23:42:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:05,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 860 [2024-10-10 23:42:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:05,524 INFO L225 Difference]: With dead ends: 30602 [2024-10-10 23:42:05,524 INFO L226 Difference]: Without dead ends: 16453 [2024-10-10 23:42:05,535 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,536 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 289 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:05,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 427 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-10 23:42:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 16124. [2024-10-10 23:42:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.032872294238045) internal successors, (16653), 16123 states have internal predecessors, (16653), 0 states have call successors, (0), 0 states have 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,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16653 transitions. [2024-10-10 23:42:05,775 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16653 transitions. Word has length 860 [2024-10-10 23:42:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:05,775 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16653 transitions. [2024-10-10 23:42:05,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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,776 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16653 transitions. [2024-10-10 23:42:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2024-10-10 23:42:05,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:05,795 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:42:05,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:42:05,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1722448950, now seen corresponding path program 1 times [2024-10-10 23:42:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819658162] [2024-10-10 23:42:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2024-10-10 23:42:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819658162] [2024-10-10 23:42:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819658162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:06,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485266086] [2024-10-10 23:42:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:06,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:06,970 INFO L87 Difference]: Start difference. First operand 16124 states and 16653 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have 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:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:07,756 INFO L93 Difference]: Finished difference Result 31589 states and 32643 transitions. [2024-10-10 23:42:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:07,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 1076 [2024-10-10 23:42:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:07,773 INFO L225 Difference]: With dead ends: 31589 [2024-10-10 23:42:07,773 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:42:07,781 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:07,783 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:07,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 374 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:42:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2024-10-10 23:42:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0286547168641071) internal successors, (16585), 16123 states have internal predecessors, (16585), 0 states have call successors, (0), 0 states have 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:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16585 transitions. [2024-10-10 23:42:07,931 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16585 transitions. Word has length 1076 [2024-10-10 23:42:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:07,932 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16585 transitions. [2024-10-10 23:42:07,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have 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:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16585 transitions. [2024-10-10 23:42:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2024-10-10 23:42:07,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:07,955 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, 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, 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:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:42:07,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash 478826713, now seen corresponding path program 1 times [2024-10-10 23:42:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492048470] [2024-10-10 23:42:07,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 1790 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-10-10 23:42:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492048470] [2024-10-10 23:42:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492048470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:08,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:08,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66760261] [2024-10-10 23:42:08,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:08,697 INFO L87 Difference]: Start difference. First operand 16124 states and 16585 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:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:09,446 INFO L93 Difference]: Finished difference Result 31589 states and 32507 transitions. [2024-10-10 23:42:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:09,447 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 1133 [2024-10-10 23:42:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:09,461 INFO L225 Difference]: With dead ends: 31589 [2024-10-10 23:42:09,461 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:42:09,475 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:09,475 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:09,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 425 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:42:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 14808. [2024-10-10 23:42:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0228945768893092) internal successors, (15146), 14807 states have internal predecessors, (15146), 0 states have call successors, (0), 0 states have 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:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15146 transitions. [2024-10-10 23:42:09,696 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15146 transitions. Word has length 1133 [2024-10-10 23:42:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:09,697 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15146 transitions. [2024-10-10 23:42:09,697 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:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15146 transitions. [2024-10-10 23:42:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1135 [2024-10-10 23:42:09,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:09,729 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, 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, 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:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:42:09,729 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1413327840, now seen corresponding path program 1 times [2024-10-10 23:42:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859609545] [2024-10-10 23:42:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-10 23:42:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859609545] [2024-10-10 23:42:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859609545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718402137] [2024-10-10 23:42:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:10,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:10,387 INFO L87 Difference]: Start difference. First operand 14808 states and 15146 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:11,095 INFO L93 Difference]: Finished difference Result 32247 states and 33029 transitions. [2024-10-10 23:42:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 1134 [2024-10-10 23:42:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:11,110 INFO L225 Difference]: With dead ends: 32247 [2024-10-10 23:42:11,110 INFO L226 Difference]: Without dead ends: 15795 [2024-10-10 23:42:11,124 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:11,124 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.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:11,125 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.6s Time] [2024-10-10 23:42:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2024-10-10 23:42:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 13163. [2024-10-10 23:42:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0198298130983132) internal successors, (13423), 13162 states have internal predecessors, (13423), 0 states have call successors, (0), 0 states have 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:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13423 transitions. [2024-10-10 23:42:11,279 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13423 transitions. Word has length 1134 [2024-10-10 23:42:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13423 transitions. [2024-10-10 23:42:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13423 transitions. [2024-10-10 23:42:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2024-10-10 23:42:11,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:11,298 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, 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, 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:11,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:42:11,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:11,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1849628761, now seen corresponding path program 1 times [2024-10-10 23:42:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:11,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457673603] [2024-10-10 23:42:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:11,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4062 backedges. 2503 proven. 0 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2024-10-10 23:42:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457673603] [2024-10-10 23:42:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457673603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523836552] [2024-10-10 23:42:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:12,367 INFO L87 Difference]: Start difference. First operand 13163 states and 13423 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:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:13,004 INFO L93 Difference]: Finished difference Result 26325 states and 26849 transitions. [2024-10-10 23:42:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:13,006 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 1389 [2024-10-10 23:42:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:13,022 INFO L225 Difference]: With dead ends: 26325 [2024-10-10 23:42:13,022 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:42:13,091 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,091 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:13,091 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:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:42:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2024-10-10 23:42:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0191751085383502) internal successors, (14085), 13820 states have internal predecessors, (14085), 0 states have call successors, (0), 0 states have 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,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14085 transitions. [2024-10-10 23:42:13,176 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14085 transitions. Word has length 1389 [2024-10-10 23:42:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:13,177 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14085 transitions. [2024-10-10 23:42:13,177 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:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14085 transitions. [2024-10-10 23:42:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1428 [2024-10-10 23:42:13,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:13,192 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, 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, 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:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:42:13,193 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash 203494091, now seen corresponding path program 1 times [2024-10-10 23:42:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819179048] [2024-10-10 23:42:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3823 backedges. 2719 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-10 23:42:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819179048] [2024-10-10 23:42:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819179048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:14,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:42:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134817481] [2024-10-10 23:42:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:14,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:42:14,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:14,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:42:14,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:42:14,710 INFO L87 Difference]: Start difference. First operand 13821 states and 14085 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:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:15,975 INFO L93 Difference]: Finished difference Result 26984 states and 27508 transitions. [2024-10-10 23:42:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:42:15,975 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 1427 [2024-10-10 23:42:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:15,987 INFO L225 Difference]: With dead ends: 26984 [2024-10-10 23:42:15,987 INFO L226 Difference]: Without dead ends: 13822 [2024-10-10 23:42:15,994 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:15,995 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 209 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:15,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 555 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:42:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-10-10 23:42:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13821. [2024-10-10 23:42:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0188856729377713) internal successors, (14081), 13820 states have internal predecessors, (14081), 0 states have call successors, (0), 0 states have 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:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14081 transitions. [2024-10-10 23:42:16,098 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14081 transitions. Word has length 1427 [2024-10-10 23:42:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:16,099 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14081 transitions. [2024-10-10 23:42:16,099 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:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14081 transitions. [2024-10-10 23:42:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2024-10-10 23:42:16,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:16,114 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, 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, 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:16,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:42:16,114 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:16,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -460050444, now seen corresponding path program 1 times [2024-10-10 23:42:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:16,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662784961] [2024-10-10 23:42:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3689 backedges. 2622 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-10 23:42:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662784961] [2024-10-10 23:42:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662784961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:17,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:17,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354507358] [2024-10-10 23:42:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:17,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:17,218 INFO L87 Difference]: Start difference. First operand 13821 states and 14081 transitions. Second operand has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 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:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:17,902 INFO L93 Difference]: Finished difference Result 26983 states and 27499 transitions. [2024-10-10 23:42:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:17,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 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 1441 [2024-10-10 23:42:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:17,913 INFO L225 Difference]: With dead ends: 26983 [2024-10-10 23:42:17,914 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:42:17,920 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,921 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 62 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:17,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 423 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:42:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2024-10-10 23:42:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0185962373371924) internal successors, (14077), 13820 states have internal predecessors, (14077), 0 states have call successors, (0), 0 states have 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:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14077 transitions. [2024-10-10 23:42:18,019 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14077 transitions. Word has length 1441 [2024-10-10 23:42:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:18,019 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14077 transitions. [2024-10-10 23:42:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 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:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14077 transitions. [2024-10-10 23:42:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1444 [2024-10-10 23:42:18,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:18,034 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, 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, 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:18,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:42:18,034 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1044815156, now seen corresponding path program 1 times [2024-10-10 23:42:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567937924] [2024-10-10 23:42:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 1281 proven. 0 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2024-10-10 23:42:18,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567937924] [2024-10-10 23:42:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567937924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:18,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212883011] [2024-10-10 23:42:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:18,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:18,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:18,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:18,718 INFO L87 Difference]: Start difference. First operand 13821 states and 14077 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:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:19,430 INFO L93 Difference]: Finished difference Result 26981 states and 27490 transitions. [2024-10-10 23:42:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:19,431 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 1443 [2024-10-10 23:42:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:19,432 INFO L225 Difference]: With dead ends: 26981 [2024-10-10 23:42:19,432 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:42:19,440 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,441 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:19,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 410 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:42:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:42:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:42:19,446 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:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:42:19,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1443 [2024-10-10 23:42:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:42:19,447 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:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:42:19,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:42:19,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:42:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:42:19,453 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, 1] [2024-10-10 23:42:19,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:42:20,704 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:42:20,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:42:20 BoogieIcfgContainer [2024-10-10 23:42:20,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:42:20,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:42:20,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:42:20,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:42:20,727 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:41" (3/4) ... [2024-10-10 23:42:20,729 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:42:20,755 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:42:20,757 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:42:20,758 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:42:20,760 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:42:20,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:42:20,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:42:20,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:42:20,978 INFO L158 Benchmark]: Toolchain (without parser) took 43068.54ms. Allocated memory was 180.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 142.7MB in the beginning and 937.5MB in the end (delta: -794.9MB). Peak memory consumption was 895.5MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,978 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:42:20,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 919.63ms. Allocated memory is still 180.4MB. Free memory was 142.7MB in the beginning and 78.7MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.00ms. Allocated memory is still 180.4MB. Free memory was 78.7MB in the beginning and 54.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,978 INFO L158 Benchmark]: Boogie Preprocessor took 399.92ms. Allocated memory is still 180.4MB. Free memory was 54.6MB in the beginning and 129.8MB in the end (delta: -75.2MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,979 INFO L158 Benchmark]: RCFGBuilder took 2271.97ms. Allocated memory was 180.4MB in the beginning and 289.4MB in the end (delta: 109.1MB). Free memory was 129.0MB in the beginning and 212.4MB in the end (delta: -83.4MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,979 INFO L158 Benchmark]: TraceAbstraction took 39050.39ms. Allocated memory was 289.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 212.4MB in the beginning and 963.7MB in the end (delta: -751.3MB). Peak memory consumption was 832.0MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,979 INFO L158 Benchmark]: Witness Printer took 251.21ms. Allocated memory is still 1.9GB. Free memory was 963.7MB in the beginning and 937.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:42:20,984 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.16ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 919.63ms. Allocated memory is still 180.4MB. Free memory was 142.7MB in the beginning and 78.7MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.00ms. Allocated memory is still 180.4MB. Free memory was 78.7MB in the beginning and 54.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 399.92ms. Allocated memory is still 180.4MB. Free memory was 54.6MB in the beginning and 129.8MB in the end (delta: -75.2MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2271.97ms. Allocated memory was 180.4MB in the beginning and 289.4MB in the end (delta: 109.1MB). Free memory was 129.0MB in the beginning and 212.4MB in the end (delta: -83.4MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39050.39ms. Allocated memory was 289.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 212.4MB in the beginning and 963.7MB in the end (delta: -751.3MB). Peak memory consumption was 832.0MB. Max. memory is 16.1GB. * Witness Printer took 251.21ms. Allocated memory is still 1.9GB. Free memory was 963.7MB in the beginning and 937.5MB in the end (delta: 26.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: 167]: 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: 37.7s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4687 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4687 mSDsluCounter, 7139 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 2713 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21030 IncrementalHoareTripleChecker+Invalid, 23743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2713 mSolverCounterUnsat, 6834 mSDtfsCounter, 21030 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16124occurred in iteration=15, InterpolantAutomatonStates: 74, 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, 22 MinimizatonAttempts, 8557 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 15134 NumberOfCodeBlocks, 15134 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 15112 ConstructedInterpolants, 0 QuantifiedInterpolants, 32138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 27973/27973 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 == 9) && (7 == a12)) || ((a16 == 10) && (a12 == 6))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || ((((a16 == 11) && (5 == a12)) && (((long long) 87 + a18) == 0)) && (a15 == 3))) || ((((5 == a12) && (a16 <= 11)) && (a15 == 3)) && (83 <= a18))) || (((a12 == 9) && (a15 <= 3)) && (a16 == 12))) || (((a12 <= 5) && (a16 == 10)) && (a15 != 3))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 8)) && (a16 <= 11))) || ((a12 == 9) && (a16 == 9))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || (((0 <= ((long long) 87 + a18)) && (a16 == 10)) && (5 == a12))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((a16 == 8) && (5 == a12))) || ((a16 == 8) && (a12 == 6))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || (((a16 == 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6)) && (a16 == 12))) || ((a16 == 9) && (5 == a12))) || ((a16 == 9) && (a12 == 8))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || ((a12 == 9) && (a16 == 8))) || (((a16 == 10) && (a15 <= 3)) && (a12 == 8))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || (((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a12 == 8))) || ((((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a15 <= 3)) && (7 <= a12))) || (((a16 == 9) && (a15 != 3)) && (a12 == 6))) || ((((a15 <= 3) && (a12 == 6)) && (((long long) 87 + a18) == 0)) && (a16 <= 11))) || (((a16 == 12) && (5 == a12)) && (a15 == 3))) || (((a12 <= 5) && (a16 == 8)) && (a15 != 3))) || (((a12 <= 5) && (a16 == 9)) && (a15 != 3))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:42:21,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE