./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label47.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:50:42,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:50:42,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:50:42,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:50:42,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:50:42,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:50:42,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:50:42,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:50:42,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:50:42,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:50:42,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:50:42,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:50:42,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:50:42,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:50:42,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:50:42,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:50:42,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:50:42,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:50:42,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:50:42,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:50:42,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:50:42,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:50:42,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:50:42,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:50:42,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:50:42,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:50:42,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:50:42,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:50:42,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:50:42,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:50:42,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:50:42,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:50:42,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:42,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:50:42,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:50:42,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:50:42,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:50:42,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:50:42,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:50:42,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:50:42,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:50:42,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:50:42,175 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/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/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 -> d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea [2024-11-11 16:50:42,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:50:42,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:50:42,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:50:42,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:50:42,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:50:42,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-11-11 16:50:43,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:50:44,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:50:44,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-11-11 16:50:44,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f663c953/8006407dc5e74a5fa378fcdd37bb77ea/FLAGbedcf282b [2024-11-11 16:50:44,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f663c953/8006407dc5e74a5fa378fcdd37bb77ea [2024-11-11 16:50:44,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:50:44,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:50:44,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:44,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:50:44,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:50:44,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6558c49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44, skipping insertion in model container [2024-11-11 16:50:44,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:50:44,362 WARN L250 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/Problem11_label47.c[5129,5142] [2024-11-11 16:50:44,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:44,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:50:44,599 WARN L250 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/Problem11_label47.c[5129,5142] [2024-11-11 16:50:44,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:44,689 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:50:44,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44 WrapperNode [2024-11-11 16:50:44,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:44,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:44,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:50:44,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:50:44,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,822 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:50:44,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:44,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:50:44,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:50:44,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:50:44,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,881 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-11-11 16:50:44,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:50:44,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:50:44,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:50:44,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:50:44,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (1/1) ... [2024-11-11 16:50:44,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:50:44,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:50:44,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:50:45,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:50:45,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:50:45,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:50:45,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:50:45,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:50:45,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:50:46,499 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:50:46,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:50:46,521 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:50:46,522 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:50:46,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:46 BoogieIcfgContainer [2024-11-11 16:50:46,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:50:46,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:50:46,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:50:46,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:50:46,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:50:44" (1/3) ... [2024-11-11 16:50:46,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9ce245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:46, skipping insertion in model container [2024-11-11 16:50:46,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:44" (2/3) ... [2024-11-11 16:50:46,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9ce245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:46, skipping insertion in model container [2024-11-11 16:50:46,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:46" (3/3) ... [2024-11-11 16:50:46,531 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2024-11-11 16:50:46,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:50:46,544 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:50:46,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:50:46,628 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;@5ac129b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:50:46,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:50:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 16:50:46,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:46,638 INFO L218 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] [2024-11-11 16:50:46,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2024-11-11 16:50:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:46,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037427747] [2024-11-11 16:50:46,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:46,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037427747] [2024-11-11 16:50:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037427747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:46,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:46,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382630847] [2024-11-11 16:50:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:46,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:46,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:46,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:46,989 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:48,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:48,000 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-11 16:50:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:48,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-11 16:50:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:48,012 INFO L225 Difference]: With dead ends: 776 [2024-11-11 16:50:48,013 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:50:48,017 INFO L434 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-11-11 16:50:48,019 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 192 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:48,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:50:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:50:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-11 16:50:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-11 16:50:48,078 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 35 [2024-11-11 16:50:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:48,078 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-11 16:50:48,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-11 16:50:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 16:50:48,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:48,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:48,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:50:48,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1354901288, now seen corresponding path program 1 times [2024-11-11 16:50:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026967781] [2024-11-11 16:50:48,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026967781] [2024-11-11 16:50:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026967781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:48,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984548255] [2024-11-11 16:50:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:48,306 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:48,944 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-11 16:50:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-11 16:50:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:48,948 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 16:50:48,954 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:50:48,957 INFO L434 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-11-11 16:50:48,958 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:48,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:50:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-11 16:50:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2024-11-11 16:50:48,984 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 103 [2024-11-11 16:50:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:48,984 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2024-11-11 16:50:48,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2024-11-11 16:50:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 16:50:48,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:48,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:48,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:50:48,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:48,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1556935149, now seen corresponding path program 1 times [2024-11-11 16:50:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322157014] [2024-11-11 16:50:48,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322157014] [2024-11-11 16:50:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322157014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:49,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:49,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:49,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378515632] [2024-11-11 16:50:49,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:49,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:49,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:49,238 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:49,811 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2024-11-11 16:50:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:49,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-11 16:50:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:49,815 INFO L225 Difference]: With dead ends: 1942 [2024-11-11 16:50:49,815 INFO L226 Difference]: Without dead ends: 1157 [2024-11-11 16:50:49,816 INFO L434 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-11-11 16:50:49,817 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:49,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:50:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-11 16:50:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-11 16:50:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2024-11-11 16:50:49,860 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 105 [2024-11-11 16:50:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:49,863 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2024-11-11 16:50:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2024-11-11 16:50:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 16:50:49,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:49,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:49,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:50:49,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1368272740, now seen corresponding path program 1 times [2024-11-11 16:50:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:49,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25954818] [2024-11-11 16:50:49,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 16:50:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25954818] [2024-11-11 16:50:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25954818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211302796] [2024-11-11 16:50:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:50,115 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 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-11-11 16:50:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:51,156 INFO L93 Difference]: Finished difference Result 2502 states and 3336 transitions. [2024-11-11 16:50:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:51,157 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 147 [2024-11-11 16:50:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:51,164 INFO L225 Difference]: With dead ends: 2502 [2024-11-11 16:50:51,164 INFO L226 Difference]: Without dead ends: 1532 [2024-11-11 16:50:51,167 INFO L434 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-11-11 16:50:51,169 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:51,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:50:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-11 16:50:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-11 16:50:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2612671456564337) internal successors, (1931), 1531 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1931 transitions. [2024-11-11 16:50:51,192 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1931 transitions. Word has length 147 [2024-11-11 16:50:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:51,194 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1931 transitions. [2024-11-11 16:50:51,194 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-11-11 16:50:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1931 transitions. [2024-11-11 16:50:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 16:50:51,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:51,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:50:51,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 162112077, now seen corresponding path program 1 times [2024-11-11 16:50:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946178448] [2024-11-11 16:50:51,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946178448] [2024-11-11 16:50:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946178448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388103410] [2024-11-11 16:50:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:51,376 INFO L87 Difference]: Start difference. First operand 1532 states and 1931 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:53,130 INFO L93 Difference]: Finished difference Result 4931 states and 6392 transitions. [2024-11-11 16:50:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:50:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-11-11 16:50:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:53,144 INFO L225 Difference]: With dead ends: 4931 [2024-11-11 16:50:53,144 INFO L226 Difference]: Without dead ends: 3585 [2024-11-11 16:50:53,147 INFO L434 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-11-11 16:50:53,150 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 329 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:53,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 95 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 16:50:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2024-11-11 16:50:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3584. [2024-11-11 16:50:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3583 states have (on average 1.2539771141501534) internal successors, (4493), 3583 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4493 transitions. [2024-11-11 16:50:53,205 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4493 transitions. Word has length 162 [2024-11-11 16:50:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:53,205 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 4493 transitions. [2024-11-11 16:50:53,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4493 transitions. [2024-11-11 16:50:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 16:50:53,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:53,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 16:50:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:50:53,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1953439888, now seen corresponding path program 1 times [2024-11-11 16:50:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459186802] [2024-11-11 16:50:53,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:50:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459186802] [2024-11-11 16:50:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459186802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939573084] [2024-11-11 16:50:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:53,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:53,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:53,416 INFO L87 Difference]: Start difference. First operand 3584 states and 4493 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:54,230 INFO L93 Difference]: Finished difference Result 8098 states and 10366 transitions. [2024-11-11 16:50:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-11-11 16:50:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:54,242 INFO L225 Difference]: With dead ends: 8098 [2024-11-11 16:50:54,242 INFO L226 Difference]: Without dead ends: 4884 [2024-11-11 16:50:54,245 INFO L434 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-11-11 16:50:54,246 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 162 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:54,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 393 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:50:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2024-11-11 16:50:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4873. [2024-11-11 16:50:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4872 states have (on average 1.2261904761904763) internal successors, (5974), 4872 states have internal predecessors, (5974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 5974 transitions. [2024-11-11 16:50:54,307 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 5974 transitions. Word has length 217 [2024-11-11 16:50:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:54,307 INFO L471 AbstractCegarLoop]: Abstraction has 4873 states and 5974 transitions. [2024-11-11 16:50:54,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5974 transitions. [2024-11-11 16:50:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-11 16:50:54,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:54,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 16:50:54,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:50:54,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:54,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -483839329, now seen corresponding path program 1 times [2024-11-11 16:50:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640150903] [2024-11-11 16:50:54,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 16:50:54,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:54,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640150903] [2024-11-11 16:50:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640150903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:54,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:54,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996448970] [2024-11-11 16:50:54,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:54,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:54,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:54,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:54,488 INFO L87 Difference]: Start difference. First operand 4873 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:55,160 INFO L93 Difference]: Finished difference Result 11041 states and 13752 transitions. [2024-11-11 16:50:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 223 [2024-11-11 16:50:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:55,176 INFO L225 Difference]: With dead ends: 11041 [2024-11-11 16:50:55,176 INFO L226 Difference]: Without dead ends: 6354 [2024-11-11 16:50:55,181 INFO L434 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-11-11 16:50:55,182 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:55,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2024-11-11 16:50:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 6345. [2024-11-11 16:50:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 6344 states have (on average 1.2102774274905423) internal successors, (7678), 6344 states have internal predecessors, (7678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 7678 transitions. [2024-11-11 16:50:55,256 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 7678 transitions. Word has length 223 [2024-11-11 16:50:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 6345 states and 7678 transitions. [2024-11-11 16:50:55,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 7678 transitions. [2024-11-11 16:50:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-11 16:50:55,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:55,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:55,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:50:55,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:55,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1501095785, now seen corresponding path program 1 times [2024-11-11 16:50:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:55,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561795321] [2024-11-11 16:50:55,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561795321] [2024-11-11 16:50:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561795321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:55,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:55,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 16:50:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23325178] [2024-11-11 16:50:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:50:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:50:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:50:55,803 INFO L87 Difference]: Start difference. First operand 6345 states and 7678 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:57,261 INFO L93 Difference]: Finished difference Result 13287 states and 16079 transitions. [2024-11-11 16:50:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:50:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2024-11-11 16:50:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:57,280 INFO L225 Difference]: With dead ends: 13287 [2024-11-11 16:50:57,280 INFO L226 Difference]: Without dead ends: 7312 [2024-11-11 16:50:57,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:50:57,287 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 530 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:57,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 185 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 16:50:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2024-11-11 16:50:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 7266. [2024-11-11 16:50:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7266 states, 7265 states have (on average 1.1940812112869925) internal successors, (8675), 7265 states have internal predecessors, (8675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 8675 transitions. [2024-11-11 16:50:57,378 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 8675 transitions. Word has length 276 [2024-11-11 16:50:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 7266 states and 8675 transitions. [2024-11-11 16:50:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 8675 transitions. [2024-11-11 16:50:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-11 16:50:57,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:57,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:50:57,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:57,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1369513305, now seen corresponding path program 1 times [2024-11-11 16:50:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134804499] [2024-11-11 16:50:57,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-11 16:50:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134804499] [2024-11-11 16:50:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134804499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250098473] [2024-11-11 16:50:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:57,566 INFO L87 Difference]: Start difference. First operand 7266 states and 8675 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:58,175 INFO L93 Difference]: Finished difference Result 15629 states and 19055 transitions. [2024-11-11 16:50:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2024-11-11 16:50:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:58,203 INFO L225 Difference]: With dead ends: 15629 [2024-11-11 16:50:58,203 INFO L226 Difference]: Without dead ends: 9472 [2024-11-11 16:50:58,210 INFO L434 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-11-11 16:50:58,212 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 192 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:58,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 324 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2024-11-11 16:50:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 9103. [2024-11-11 16:50:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9103 states, 9102 states have (on average 1.1999560536145901) internal successors, (10922), 9102 states have internal predecessors, (10922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9103 states to 9103 states and 10922 transitions. [2024-11-11 16:50:58,330 INFO L78 Accepts]: Start accepts. Automaton has 9103 states and 10922 transitions. Word has length 281 [2024-11-11 16:50:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:58,330 INFO L471 AbstractCegarLoop]: Abstraction has 9103 states and 10922 transitions. [2024-11-11 16:50:58,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9103 states and 10922 transitions. [2024-11-11 16:50:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-11 16:50:58,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:58,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:50:58,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:50:58,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:58,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash -30382884, now seen corresponding path program 1 times [2024-11-11 16:50:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023812989] [2024-11-11 16:50:58,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-11 16:50:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023812989] [2024-11-11 16:50:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023812989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:58,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:58,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833671991] [2024-11-11 16:50:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:58,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:58,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:58,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:58,483 INFO L87 Difference]: Start difference. First operand 9103 states and 10922 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:59,177 INFO L93 Difference]: Finished difference Result 18752 states and 22847 transitions. [2024-11-11 16:50:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 300 [2024-11-11 16:50:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:59,193 INFO L225 Difference]: With dead ends: 18752 [2024-11-11 16:50:59,194 INFO L226 Difference]: Without dead ends: 10758 [2024-11-11 16:50:59,201 INFO L434 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-11-11 16:50:59,202 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 189 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:59,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 148 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2024-11-11 16:50:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 9832. [2024-11-11 16:50:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9832 states, 9831 states have (on average 1.1803478791577662) internal successors, (11604), 9831 states have internal predecessors, (11604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 11604 transitions. [2024-11-11 16:50:59,310 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 11604 transitions. Word has length 300 [2024-11-11 16:50:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:59,310 INFO L471 AbstractCegarLoop]: Abstraction has 9832 states and 11604 transitions. [2024-11-11 16:50:59,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 11604 transitions. [2024-11-11 16:50:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-11 16:50:59,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:59,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-11-11 16:50:59,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:50:59,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:59,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 147510905, now seen corresponding path program 1 times [2024-11-11 16:50:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944378350] [2024-11-11 16:50:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944378350] [2024-11-11 16:50:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944378350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:59,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:50:59,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801042545] [2024-11-11 16:50:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:59,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:59,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:59,660 INFO L87 Difference]: Start difference. First operand 9832 states and 11604 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:00,806 INFO L93 Difference]: Finished difference Result 23914 states and 28684 transitions. [2024-11-11 16:51:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2024-11-11 16:51:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:00,828 INFO L225 Difference]: With dead ends: 23914 [2024-11-11 16:51:00,828 INFO L226 Difference]: Without dead ends: 15191 [2024-11-11 16:51:00,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:00,838 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 255 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:00,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 68 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 16:51:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15191 states. [2024-11-11 16:51:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15191 to 13516. [2024-11-11 16:51:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13516 states, 13515 states have (on average 1.1859415464298928) internal successors, (16028), 13515 states have internal predecessors, (16028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13516 states to 13516 states and 16028 transitions. [2024-11-11 16:51:01,104 INFO L78 Accepts]: Start accepts. Automaton has 13516 states and 16028 transitions. Word has length 340 [2024-11-11 16:51:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:01,104 INFO L471 AbstractCegarLoop]: Abstraction has 13516 states and 16028 transitions. [2024-11-11 16:51:01,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 13516 states and 16028 transitions. [2024-11-11 16:51:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-11 16:51:01,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:01,124 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:51:01,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:51:01,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:01,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1732339891, now seen corresponding path program 1 times [2024-11-11 16:51:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694487694] [2024-11-11 16:51:01,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:51:01,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:01,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694487694] [2024-11-11 16:51:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694487694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117434242] [2024-11-11 16:51:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:01,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:01,633 INFO L87 Difference]: Start difference. First operand 13516 states and 16028 transitions. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 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-11-11 16:51:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:02,803 INFO L93 Difference]: Finished difference Result 29622 states and 35606 transitions. [2024-11-11 16:51:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 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 414 [2024-11-11 16:51:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:02,830 INFO L225 Difference]: With dead ends: 29622 [2024-11-11 16:51:02,830 INFO L226 Difference]: Without dead ends: 17215 [2024-11-11 16:51:02,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:02,843 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 255 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:02,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 68 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 16:51:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17215 states. [2024-11-11 16:51:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17215 to 13148. [2024-11-11 16:51:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13148 states, 13147 states have (on average 1.1870388681828554) internal successors, (15606), 13147 states have internal predecessors, (15606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13148 states to 13148 states and 15606 transitions. [2024-11-11 16:51:02,995 INFO L78 Accepts]: Start accepts. Automaton has 13148 states and 15606 transitions. Word has length 414 [2024-11-11 16:51:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:02,996 INFO L471 AbstractCegarLoop]: Abstraction has 13148 states and 15606 transitions. [2024-11-11 16:51:02,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 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-11-11 16:51:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 13148 states and 15606 transitions. [2024-11-11 16:51:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-11-11 16:51:03,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:03,014 INFO L218 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 16:51:03,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:51:03,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:03,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1202606572, now seen corresponding path program 1 times [2024-11-11 16:51:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116208192] [2024-11-11 16:51:03,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-11 16:51:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116208192] [2024-11-11 16:51:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116208192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:03,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:03,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955990719] [2024-11-11 16:51:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:03,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:03,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:03,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:03,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:03,307 INFO L87 Difference]: Start difference. First operand 13148 states and 15606 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:03,864 INFO L93 Difference]: Finished difference Result 23893 states and 28435 transitions. [2024-11-11 16:51:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 587 [2024-11-11 16:51:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:03,881 INFO L225 Difference]: With dead ends: 23893 [2024-11-11 16:51:03,882 INFO L226 Difference]: Without dead ends: 11854 [2024-11-11 16:51:03,893 INFO L434 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-11-11 16:51:03,894 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 102 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:03,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 149 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2024-11-11 16:51:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 10012. [2024-11-11 16:51:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10012 states, 10011 states have (on average 1.1403456198182) internal successors, (11416), 10011 states have internal predecessors, (11416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10012 states to 10012 states and 11416 transitions. [2024-11-11 16:51:03,995 INFO L78 Accepts]: Start accepts. Automaton has 10012 states and 11416 transitions. Word has length 587 [2024-11-11 16:51:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:03,996 INFO L471 AbstractCegarLoop]: Abstraction has 10012 states and 11416 transitions. [2024-11-11 16:51:03,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10012 states and 11416 transitions. [2024-11-11 16:51:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2024-11-11 16:51:04,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:04,009 INFO L218 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:04,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:51:04,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1300910751, now seen corresponding path program 1 times [2024-11-11 16:51:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:04,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993868462] [2024-11-11 16:51:04,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-11-11 16:51:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993868462] [2024-11-11 16:51:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993868462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236503510] [2024-11-11 16:51:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:04,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:04,316 INFO L87 Difference]: Start difference. First operand 10012 states and 11416 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:05,290 INFO L93 Difference]: Finished difference Result 20201 states and 23129 transitions. [2024-11-11 16:51:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:05,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 678 [2024-11-11 16:51:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:05,291 INFO L225 Difference]: With dead ends: 20201 [2024-11-11 16:51:05,291 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:51:05,299 INFO L434 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-11-11 16:51:05,300 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 194 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:05,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 365 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:51:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:51:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:51:05,306 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-11-11 16:51:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:51:05,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 678 [2024-11-11 16:51:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:05,307 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:51:05,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:51:05,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:51:05,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:51:05,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:51:05,312 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:05,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:51:06,329 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:51:06,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:51:06 BoogieIcfgContainer [2024-11-11 16:51:06,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:51:06,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:51:06,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:51:06,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:51:06,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:46" (3/4) ... [2024-11-11 16:51:06,348 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:51:06,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:51:06,369 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:51:06,370 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:51:06,371 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:51:06,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:51:06,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:51:06,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:51:06,557 INFO L158 Benchmark]: Toolchain (without parser) took 22456.54ms. Allocated memory was 146.8MB in the beginning and 971.0MB in the end (delta: 824.2MB). Free memory was 71.9MB in the beginning and 528.4MB in the end (delta: -456.5MB). Peak memory consumption was 370.4MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,557 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:51:06,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.47ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 71.6MB in the beginning and 159.4MB in the end (delta: -87.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.34ms. Allocated memory is still 222.3MB. Free memory was 159.4MB in the beginning and 141.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,557 INFO L158 Benchmark]: Boogie Preprocessor took 123.10ms. Allocated memory is still 222.3MB. Free memory was 141.6MB in the beginning and 116.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,558 INFO L158 Benchmark]: RCFGBuilder took 1575.91ms. Allocated memory is still 222.3MB. Free memory was 116.4MB in the beginning and 125.1MB in the end (delta: -8.7MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,558 INFO L158 Benchmark]: TraceAbstraction took 19817.00ms. Allocated memory was 222.3MB in the beginning and 971.0MB in the end (delta: 748.7MB). Free memory was 125.1MB in the beginning and 546.2MB in the end (delta: -421.1MB). Peak memory consumption was 345.4MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,558 INFO L158 Benchmark]: Witness Printer took 214.17ms. Allocated memory is still 971.0MB. Free memory was 546.2MB in the beginning and 528.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 16:51:06,563 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.11ms. Allocated memory is still 146.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.47ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 71.6MB in the beginning and 159.4MB in the end (delta: -87.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.34ms. Allocated memory is still 222.3MB. Free memory was 159.4MB in the beginning and 141.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.10ms. Allocated memory is still 222.3MB. Free memory was 141.6MB in the beginning and 116.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1575.91ms. Allocated memory is still 222.3MB. Free memory was 116.4MB in the beginning and 125.1MB in the end (delta: -8.7MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19817.00ms. Allocated memory was 222.3MB in the beginning and 971.0MB in the end (delta: 748.7MB). Free memory was 125.1MB in the beginning and 546.2MB in the end (delta: -421.1MB). Peak memory consumption was 345.4MB. Max. memory is 16.1GB. * Witness Printer took 214.17ms. Allocated memory is still 971.0MB. Free memory was 546.2MB in the beginning and 528.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. 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: 121]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2930 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2930 mSDsluCounter, 2850 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 417 mSDsCounter, 1957 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10484 IncrementalHoareTripleChecker+Invalid, 12441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1957 mSolverCounterUnsat, 2433 mSDtfsCounter, 10484 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13516occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 8962 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3868 NumberOfCodeBlocks, 3868 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3854 ConstructedInterpolants, 0 QuantifiedInterpolants, 10100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3952/3952 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: 1044]: Loop Invariant Derived loop invariant: (((((((((a29 <= 599998) && (a4 != 1)) || (((a25 <= 10) && (a29 <= 599999)) && (((long long) a23 + 599772) <= 0))) || (((long long) a29 + 21) <= 0)) || ((((307 <= a23) && (a25 == 11)) && (a29 <= 599999)) && (a4 == 1))) || ((a25 == 11) && (a29 <= 599998))) || ((a25 == 13) && (a29 <= 599998))) || ((307 <= a23) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:51:06,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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