./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_label55.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 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:05:09,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:05:09,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:05:09,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:05:09,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:05:09,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:05:09,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:05:09,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:05:09,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:05:09,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:05:09,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:05:09,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:05:09,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:05:09,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:05:09,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:05:09,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:05:09,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:05:09,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:05:09,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:05:09,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:05:09,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:05:09,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:05:09,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:05:09,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:05:09,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:05:09,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:05:09,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:05:09,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:05:09,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:05:09,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:05:09,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:05:09,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:05:09,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:05:09,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:05:09,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:05:09,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:05:09,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:05:09,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:05:09,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:05:09,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:05:09,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:05:09,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:05:09,138 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 -> 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 [2024-11-21 22:05:09,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:05:09,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:05:09,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:05:09,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:05:09,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:05:09,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2024-11-21 22:05:10,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:05:11,130 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:05:11,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2024-11-21 22:05:11,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e43ea6f8/cf643a2ec11e40698de582f2d5553ad7/FLAG80ab08459 [2024-11-21 22:05:11,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e43ea6f8/cf643a2ec11e40698de582f2d5553ad7 [2024-11-21 22:05:11,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:05:11,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:05:11,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:05:11,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:05:11,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:05:11,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:11" (1/1) ... [2024-11-21 22:05:11,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390b6c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:11, skipping insertion in model container [2024-11-21 22:05:11,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:11" (1/1) ... [2024-11-21 22:05:11,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:05:11,837 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_label55.c[6546,6559] [2024-11-21 22:05:12,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:05:12,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:05:12,078 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_label55.c[6546,6559] [2024-11-21 22:05:12,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:05:12,197 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:05:12,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12 WrapperNode [2024-11-21 22:05:12,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:05:12,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:05:12,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:05:12,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:05:12,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,324 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-21 22:05:12,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:05:12,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:05:12,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:05:12,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:05:12,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,474 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-21 22:05:12,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:05:12,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:05:12,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:05:12,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:05:12,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (1/1) ... [2024-11-21 22:05:12,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:05:12,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:12,617 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-21 22:05:12,621 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-21 22:05:12,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:05:12,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:05:12,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:05:12,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:05:12,724 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:05:12,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:05:14,134 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-21 22:05:14,134 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:05:14,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:05:14,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:05:14,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:14 BoogieIcfgContainer [2024-11-21 22:05:14,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:05:14,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:05:14,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:05:14,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:05:14,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:05:11" (1/3) ... [2024-11-21 22:05:14,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df49695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:14, skipping insertion in model container [2024-11-21 22:05:14,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:12" (2/3) ... [2024-11-21 22:05:14,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df49695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:14, skipping insertion in model container [2024-11-21 22:05:14,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:14" (3/3) ... [2024-11-21 22:05:14,171 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2024-11-21 22:05:14,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:05:14,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:05:14,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:05:14,272 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;@4b9c1537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:05:14,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:05:14,278 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-21 22:05:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 22:05:14,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:14,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:14,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2024-11-21 22:05:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390970779] [2024-11-21 22:05:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:14,737 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-21 22:05:14,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:14,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390970779] [2024-11-21 22:05:14,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390970779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788619157] [2024-11-21 22:05:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:14,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:14,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:14,777 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 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-21 22:05:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:15,849 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-21 22:05:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-21 22:05:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:15,863 INFO L225 Difference]: With dead ends: 776 [2024-11-21 22:05:15,863 INFO L226 Difference]: Without dead ends: 413 [2024-11-21 22:05:15,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:15,870 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 182 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:15,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 22:05:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-21 22:05:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-21 22:05:15,933 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-21 22:05:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-21 22:05:15,938 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 45 [2024-11-21 22:05:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:15,938 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-21 22:05:15,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-21 22:05:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-21 22:05:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-21 22:05:15,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:15,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-21 22:05:15,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:05:15,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -954308976, now seen corresponding path program 1 times [2024-11-21 22:05:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429264759] [2024-11-21 22:05:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429264759] [2024-11-21 22:05:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429264759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:16,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143825630] [2024-11-21 22:05:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:16,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:16,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:16,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:16,154 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:16,836 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-21 22:05:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:16,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-21 22:05:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:16,841 INFO L225 Difference]: With dead ends: 1209 [2024-11-21 22:05:16,841 INFO L226 Difference]: Without dead ends: 800 [2024-11-21 22:05:16,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:16,844 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 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.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:16,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-21 22:05:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-21 22:05:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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-21 22:05:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-21 22:05:16,875 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 113 [2024-11-21 22:05:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:16,875 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-21 22:05:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-21 22:05:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-21 22:05:16,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:16,880 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:05:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:05:16,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:16,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash 975979568, now seen corresponding path program 1 times [2024-11-21 22:05:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285390017] [2024-11-21 22:05:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:17,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285390017] [2024-11-21 22:05:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285390017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191390123] [2024-11-21 22:05:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:17,275 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-21 22:05:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:17,983 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-21 22:05:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-21 22:05:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:17,990 INFO L225 Difference]: With dead ends: 1942 [2024-11-21 22:05:17,990 INFO L226 Difference]: Without dead ends: 1157 [2024-11-21 22:05:17,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:17,994 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 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.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:17,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-21 22:05:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-21 22:05:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-21 22:05:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-21 22:05:18,031 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 114 [2024-11-21 22:05:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-21 22:05:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-21 22:05:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-21 22:05:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-21 22:05:18,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:18,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:05:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:05:18,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -103496756, now seen corresponding path program 1 times [2024-11-21 22:05:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:18,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247993170] [2024-11-21 22:05:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-21 22:05:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:18,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247993170] [2024-11-21 22:05:18,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247993170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:18,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:18,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113678841] [2024-11-21 22:05:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:18,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:18,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:18,309 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 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-21 22:05:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:19,094 INFO L93 Difference]: Finished difference Result 2502 states and 3339 transitions. [2024-11-21 22:05:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:19,095 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 157 [2024-11-21 22:05:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:19,100 INFO L225 Difference]: With dead ends: 2502 [2024-11-21 22:05:19,101 INFO L226 Difference]: Without dead ends: 1532 [2024-11-21 22:05:19,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:19,103 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:19,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:05:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-21 22:05:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-21 22:05:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2619203135205748) internal successors, (1932), 1531 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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-21 22:05:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1932 transitions. [2024-11-21 22:05:19,128 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1932 transitions. Word has length 157 [2024-11-21 22:05:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:19,129 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1932 transitions. [2024-11-21 22:05:19,129 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-21 22:05:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1932 transitions. [2024-11-21 22:05:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-21 22:05:19,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:19,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:05:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:05:19,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1015853899, now seen corresponding path program 1 times [2024-11-21 22:05:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846966531] [2024-11-21 22:05:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:19,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:19,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846966531] [2024-11-21 22:05:19,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846966531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:19,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:19,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627823381] [2024-11-21 22:05:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:19,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:19,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:19,348 INFO L87 Difference]: Start difference. First operand 1532 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-21 22:05:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:19,977 INFO L93 Difference]: Finished difference Result 3644 states and 4738 transitions. [2024-11-21 22:05:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-11-21 22:05:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:19,985 INFO L225 Difference]: With dead ends: 3644 [2024-11-21 22:05:19,986 INFO L226 Difference]: Without dead ends: 2298 [2024-11-21 22:05:19,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:19,989 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 190 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:19,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-21 22:05:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-21 22:05:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2654751525719268) internal successors, (2903), 2294 states have internal predecessors, (2903), 0 states have call successors, (0), 0 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-21 22:05:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2903 transitions. [2024-11-21 22:05:20,029 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2903 transitions. Word has length 172 [2024-11-21 22:05:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2903 transitions. [2024-11-21 22:05:20,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-21 22:05:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2903 transitions. [2024-11-21 22:05:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-21 22:05:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:20,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-21 22:05:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:05:20,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1543850387, now seen corresponding path program 1 times [2024-11-21 22:05:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561979703] [2024-11-21 22:05:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561979703] [2024-11-21 22:05:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561979703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409122678] [2024-11-21 22:05:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:20,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:20,292 INFO L87 Difference]: Start difference. First operand 2295 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:20,930 INFO L93 Difference]: Finished difference Result 5528 states and 7095 transitions. [2024-11-21 22:05:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:20,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-21 22:05:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:20,945 INFO L225 Difference]: With dead ends: 5528 [2024-11-21 22:05:20,946 INFO L226 Difference]: Without dead ends: 3419 [2024-11-21 22:05:20,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:20,950 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:20,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 340 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-11-21 22:05:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3218. [2024-11-21 22:05:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.2377991917935964) internal successors, (3982), 3217 states have internal predecessors, (3982), 0 states have call successors, (0), 0 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-21 22:05:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 3982 transitions. [2024-11-21 22:05:21,016 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 3982 transitions. Word has length 225 [2024-11-21 22:05:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:21,017 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 3982 transitions. [2024-11-21 22:05:21,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 3982 transitions. [2024-11-21 22:05:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-21 22:05:21,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:21,021 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:05:21,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1109508493, now seen corresponding path program 1 times [2024-11-21 22:05:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091950030] [2024-11-21 22:05:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-21 22:05:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091950030] [2024-11-21 22:05:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091950030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912934230] [2024-11-21 22:05:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:21,260 INFO L87 Difference]: Start difference. First operand 3218 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-21 22:05:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:21,946 INFO L93 Difference]: Finished difference Result 7371 states and 9143 transitions. [2024-11-21 22:05:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 226 [2024-11-21 22:05:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:21,962 INFO L225 Difference]: With dead ends: 7371 [2024-11-21 22:05:21,962 INFO L226 Difference]: Without dead ends: 4155 [2024-11-21 22:05:21,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:21,968 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:21,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 345 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-11-21 22:05:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4138. [2024-11-21 22:05:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4138 states, 4137 states have (on average 1.2211747643219724) internal successors, (5052), 4137 states have internal predecessors, (5052), 0 states have call successors, (0), 0 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-21 22:05:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 5052 transitions. [2024-11-21 22:05:22,037 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 5052 transitions. Word has length 226 [2024-11-21 22:05:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 4138 states and 5052 transitions. [2024-11-21 22:05:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-21 22:05:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 5052 transitions. [2024-11-21 22:05:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-21 22:05:22,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:22,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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-21 22:05:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:05:22,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:22,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash 616043864, now seen corresponding path program 1 times [2024-11-21 22:05:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:22,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121603773] [2024-11-21 22:05:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-21 22:05:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121603773] [2024-11-21 22:05:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121603773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:22,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:22,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127262727] [2024-11-21 22:05:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:22,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:22,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:22,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:22,312 INFO L87 Difference]: Start difference. First operand 4138 states and 5052 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-21 22:05:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:23,036 INFO L93 Difference]: Finished difference Result 9207 states and 11353 transitions. [2024-11-21 22:05:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 227 [2024-11-21 22:05:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:23,053 INFO L225 Difference]: With dead ends: 9207 [2024-11-21 22:05:23,053 INFO L226 Difference]: Without dead ends: 5071 [2024-11-21 22:05:23,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:23,059 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 152 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:23,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5071 states. [2024-11-21 22:05:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5071 to 4874. [2024-11-21 22:05:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.2087010055407346) internal successors, (5890), 4873 states have internal predecessors, (5890), 0 states have call successors, (0), 0 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-21 22:05:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 5890 transitions. [2024-11-21 22:05:23,141 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 5890 transitions. Word has length 227 [2024-11-21 22:05:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:23,142 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 5890 transitions. [2024-11-21 22:05:23,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-21 22:05:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 5890 transitions. [2024-11-21 22:05:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-21 22:05:23,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:23,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:05:23,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:05:23,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:23,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 213296906, now seen corresponding path program 1 times [2024-11-21 22:05:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:23,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989939112] [2024-11-21 22:05:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989939112] [2024-11-21 22:05:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989939112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:23,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:23,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:23,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566282796] [2024-11-21 22:05:23,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:23,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:23,530 INFO L87 Difference]: Start difference. First operand 4874 states and 5890 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-21 22:05:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:24,690 INFO L93 Difference]: Finished difference Result 15870 states and 19335 transitions. [2024-11-21 22:05:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-11-21 22:05:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:24,726 INFO L225 Difference]: With dead ends: 15870 [2024-11-21 22:05:24,726 INFO L226 Difference]: Without dead ends: 10998 [2024-11-21 22:05:24,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:24,736 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 290 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:24,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 193 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-21 22:05:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10998 states. [2024-11-21 22:05:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10998 to 8953. [2024-11-21 22:05:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8953 states, 8952 states have (on average 1.1907953529937445) internal successors, (10660), 8952 states have internal predecessors, (10660), 0 states have call successors, (0), 0 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-21 22:05:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 10660 transitions. [2024-11-21 22:05:24,906 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 10660 transitions. Word has length 247 [2024-11-21 22:05:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:24,907 INFO L471 AbstractCegarLoop]: Abstraction has 8953 states and 10660 transitions. [2024-11-21 22:05:24,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-21 22:05:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 10660 transitions. [2024-11-21 22:05:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-21 22:05:24,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:24,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:05:24,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:05:24,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:24,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash 389049443, now seen corresponding path program 1 times [2024-11-21 22:05:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49583345] [2024-11-21 22:05:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49583345] [2024-11-21 22:05:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49583345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:25,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:25,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411964926] [2024-11-21 22:05:25,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:25,387 INFO L87 Difference]: Start difference. First operand 8953 states and 10660 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:26,669 INFO L93 Difference]: Finished difference Result 22713 states and 27383 transitions. [2024-11-21 22:05:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2024-11-21 22:05:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:26,696 INFO L225 Difference]: With dead ends: 22713 [2024-11-21 22:05:26,697 INFO L226 Difference]: Without dead ends: 13762 [2024-11-21 22:05:26,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:26,711 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 300 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:26,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 120 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-21 22:05:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2024-11-21 22:05:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13378. [2024-11-21 22:05:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13378 states, 13377 states have (on average 1.1920460491889064) internal successors, (15946), 13377 states have internal predecessors, (15946), 0 states have call successors, (0), 0 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-21 22:05:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13378 states to 13378 states and 15946 transitions. [2024-11-21 22:05:26,920 INFO L78 Accepts]: Start accepts. Automaton has 13378 states and 15946 transitions. Word has length 257 [2024-11-21 22:05:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:26,921 INFO L471 AbstractCegarLoop]: Abstraction has 13378 states and 15946 transitions. [2024-11-21 22:05:26,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 13378 states and 15946 transitions. [2024-11-21 22:05:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-21 22:05:26,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:26,927 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:05:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 22:05:26,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1785532527, now seen corresponding path program 1 times [2024-11-21 22:05:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145651903] [2024-11-21 22:05:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-21 22:05:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145651903] [2024-11-21 22:05:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145651903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:05:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489626358] [2024-11-21 22:05:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:27,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:05:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:27,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:05:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 22:05:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:27,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:05:27,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:05:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-21 22:05:27,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:05:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489626358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:27,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:05:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-21 22:05:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433597860] [2024-11-21 22:05:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:27,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:05:27,526 INFO L87 Difference]: Start difference. First operand 13378 states and 15946 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-21 22:05:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:28,313 INFO L93 Difference]: Finished difference Result 32089 states and 38433 transitions. [2024-11-21 22:05:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:28,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 259 [2024-11-21 22:05:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:28,345 INFO L225 Difference]: With dead ends: 32089 [2024-11-21 22:05:28,345 INFO L226 Difference]: Without dead ends: 18713 [2024-11-21 22:05:28,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:05:28,362 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 155 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:28,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 375 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2024-11-21 22:05:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 17789. [2024-11-21 22:05:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17789 states, 17788 states have (on average 1.1721385203507984) internal successors, (20850), 17788 states have internal predecessors, (20850), 0 states have call successors, (0), 0 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-21 22:05:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17789 states to 17789 states and 20850 transitions. [2024-11-21 22:05:28,621 INFO L78 Accepts]: Start accepts. Automaton has 17789 states and 20850 transitions. Word has length 259 [2024-11-21 22:05:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:28,622 INFO L471 AbstractCegarLoop]: Abstraction has 17789 states and 20850 transitions. [2024-11-21 22:05:28,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-21 22:05:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17789 states and 20850 transitions. [2024-11-21 22:05:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-21 22:05:28,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:28,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:28,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-21 22:05:28,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-21 22:05:28,829 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -909161094, now seen corresponding path program 1 times [2024-11-21 22:05:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:28,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693224027] [2024-11-21 22:05:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-21 22:05:29,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:29,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693224027] [2024-11-21 22:05:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693224027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324930801] [2024-11-21 22:05:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:29,058 INFO L87 Difference]: Start difference. First operand 17789 states and 20850 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-21 22:05:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:29,722 INFO L93 Difference]: Finished difference Result 35586 states and 41718 transitions. [2024-11-21 22:05:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:29,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 264 [2024-11-21 22:05:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:29,746 INFO L225 Difference]: With dead ends: 35586 [2024-11-21 22:05:29,746 INFO L226 Difference]: Without dead ends: 17799 [2024-11-21 22:05:29,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:29,765 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 155 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:29,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 377 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17799 states. [2024-11-21 22:05:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17799 to 17788. [2024-11-21 22:05:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.1440377804014168) internal successors, (20349), 17787 states have internal predecessors, (20349), 0 states have call successors, (0), 0 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-21 22:05:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 20349 transitions. [2024-11-21 22:05:29,950 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 20349 transitions. Word has length 264 [2024-11-21 22:05:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:29,950 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 20349 transitions. [2024-11-21 22:05:29,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-21 22:05:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 20349 transitions. [2024-11-21 22:05:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-21 22:05:29,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:29,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:05:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 22:05:29,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:29,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1936772335, now seen corresponding path program 1 times [2024-11-21 22:05:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018502081] [2024-11-21 22:05:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 141 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018502081] [2024-11-21 22:05:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018502081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:05:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125821660] [2024-11-21 22:05:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:30,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:05:30,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:30,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:05:30,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 22:05:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:30,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 22:05:30,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:05:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:31,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:05:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125821660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:31,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:05:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-21 22:05:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448640553] [2024-11-21 22:05:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:31,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:31,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:05:31,303 INFO L87 Difference]: Start difference. First operand 17788 states and 20349 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-21 22:05:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:32,119 INFO L93 Difference]: Finished difference Result 35578 states and 40702 transitions. [2024-11-21 22:05:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:32,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-11-21 22:05:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:32,143 INFO L225 Difference]: With dead ends: 35578 [2024-11-21 22:05:32,143 INFO L226 Difference]: Without dead ends: 17792 [2024-11-21 22:05:32,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:05:32,159 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 172 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:32,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 177 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17792 states. [2024-11-21 22:05:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17792 to 17788. [2024-11-21 22:05:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.1430258053634677) internal successors, (20331), 17787 states have internal predecessors, (20331), 0 states have call successors, (0), 0 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-21 22:05:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 20331 transitions. [2024-11-21 22:05:32,359 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 20331 transitions. Word has length 278 [2024-11-21 22:05:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:32,359 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 20331 transitions. [2024-11-21 22:05:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-21 22:05:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 20331 transitions. [2024-11-21 22:05:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-21 22:05:32,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:32,370 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1] [2024-11-21 22:05:32,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 22:05:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-21 22:05:32,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1415119139, now seen corresponding path program 1 times [2024-11-21 22:05:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054992700] [2024-11-21 22:05:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-21 22:05:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054992700] [2024-11-21 22:05:32,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054992700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:32,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:32,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154696618] [2024-11-21 22:05:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:32,746 INFO L87 Difference]: Start difference. First operand 17788 states and 20331 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-21 22:05:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:33,381 INFO L93 Difference]: Finished difference Result 33137 states and 37923 transitions. [2024-11-21 22:05:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 304 [2024-11-21 22:05:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:33,393 INFO L225 Difference]: With dead ends: 33137 [2024-11-21 22:05:33,393 INFO L226 Difference]: Without dead ends: 15351 [2024-11-21 22:05:33,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:33,402 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 124 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:33,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15351 states. [2024-11-21 22:05:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15351 to 10741. [2024-11-21 22:05:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.116294227188082) internal successors, (11989), 10740 states have internal predecessors, (11989), 0 states have call successors, (0), 0 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-21 22:05:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 11989 transitions. [2024-11-21 22:05:33,516 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 11989 transitions. Word has length 304 [2024-11-21 22:05:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:33,516 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 11989 transitions. [2024-11-21 22:05:33,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-21 22:05:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 11989 transitions. [2024-11-21 22:05:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-21 22:05:33,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:33,524 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:33,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 22:05:33,525 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 63979177, now seen corresponding path program 1 times [2024-11-21 22:05:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637605959] [2024-11-21 22:05:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-21 22:05:33,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:33,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637605959] [2024-11-21 22:05:33,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637605959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:33,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:33,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:33,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064936815] [2024-11-21 22:05:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:33,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:33,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:33,686 INFO L87 Difference]: Start difference. First operand 10741 states and 11989 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-21 22:05:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:34,373 INFO L93 Difference]: Finished difference Result 23503 states and 26240 transitions. [2024-11-21 22:05:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:34,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 312 [2024-11-21 22:05:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:34,388 INFO L225 Difference]: With dead ends: 23503 [2024-11-21 22:05:34,388 INFO L226 Difference]: Without dead ends: 12764 [2024-11-21 22:05:34,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:34,397 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:34,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 144 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2024-11-21 22:05:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 10924. [2024-11-21 22:05:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10924 states, 10923 states have (on average 1.1170008239494644) internal successors, (12201), 10923 states have internal predecessors, (12201), 0 states have call successors, (0), 0 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-21 22:05:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 12201 transitions. [2024-11-21 22:05:34,539 INFO L78 Accepts]: Start accepts. Automaton has 10924 states and 12201 transitions. Word has length 312 [2024-11-21 22:05:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:34,539 INFO L471 AbstractCegarLoop]: Abstraction has 10924 states and 12201 transitions. [2024-11-21 22:05:34,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-21 22:05:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10924 states and 12201 transitions. [2024-11-21 22:05:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-21 22:05:34,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:34,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:34,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 22:05:34,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:34,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1564114315, now seen corresponding path program 1 times [2024-11-21 22:05:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330876428] [2024-11-21 22:05:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-21 22:05:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330876428] [2024-11-21 22:05:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330876428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:35,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:35,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300343426] [2024-11-21 22:05:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:35,005 INFO L87 Difference]: Start difference. First operand 10924 states and 12201 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-21 22:05:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:36,163 INFO L93 Difference]: Finished difference Result 27404 states and 30590 transitions. [2024-11-21 22:05:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 316 [2024-11-21 22:05:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:36,180 INFO L225 Difference]: With dead ends: 27404 [2024-11-21 22:05:36,181 INFO L226 Difference]: Without dead ends: 15741 [2024-11-21 22:05:36,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:36,193 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 295 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:36,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 399 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 22:05:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15741 states. [2024-11-21 22:05:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15741 to 12413. [2024-11-21 22:05:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.117386400257815) internal successors, (13869), 12412 states have internal predecessors, (13869), 0 states have call successors, (0), 0 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-21 22:05:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 13869 transitions. [2024-11-21 22:05:36,409 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 13869 transitions. Word has length 316 [2024-11-21 22:05:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:36,410 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 13869 transitions. [2024-11-21 22:05:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-21 22:05:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 13869 transitions. [2024-11-21 22:05:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-21 22:05:36,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:36,417 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-21 22:05:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 22:05:36,418 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1085023565, now seen corresponding path program 1 times [2024-11-21 22:05:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371100264] [2024-11-21 22:05:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 174 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-21 22:05:37,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371100264] [2024-11-21 22:05:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371100264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:05:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178632387] [2024-11-21 22:05:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:37,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:05:37,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:37,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:05:37,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 22:05:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:37,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 22:05:37,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:05:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-21 22:05:37,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:05:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178632387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:05:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-21 22:05:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211082339] [2024-11-21 22:05:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:05:37,864 INFO L87 Difference]: Start difference. First operand 12413 states and 13869 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-21 22:05:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:38,585 INFO L93 Difference]: Finished difference Result 25010 states and 27928 transitions. [2024-11-21 22:05:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 332 [2024-11-21 22:05:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:38,597 INFO L225 Difference]: With dead ends: 25010 [2024-11-21 22:05:38,597 INFO L226 Difference]: Without dead ends: 12599 [2024-11-21 22:05:38,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:05:38,605 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:38,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 150 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12599 states. [2024-11-21 22:05:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12599 to 12413. [2024-11-21 22:05:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.116419593941347) internal successors, (13857), 12412 states have internal predecessors, (13857), 0 states have call successors, (0), 0 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-21 22:05:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 13857 transitions. [2024-11-21 22:05:38,777 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 13857 transitions. Word has length 332 [2024-11-21 22:05:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:38,777 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 13857 transitions. [2024-11-21 22:05:38,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-21 22:05:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 13857 transitions. [2024-11-21 22:05:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-21 22:05:38,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:38,785 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 22:05:38,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 22:05:38,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:05:38,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:38,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 474538808, now seen corresponding path program 1 times [2024-11-21 22:05:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:38,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023594537] [2024-11-21 22:05:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-21 22:05:39,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:39,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023594537] [2024-11-21 22:05:39,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023594537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:39,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728461346] [2024-11-21 22:05:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:39,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:39,483 INFO L87 Difference]: Start difference. First operand 12413 states and 13857 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-21 22:05:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:40,528 INFO L93 Difference]: Finished difference Result 29071 states and 32393 transitions. [2024-11-21 22:05:40,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 354 [2024-11-21 22:05:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:40,539 INFO L225 Difference]: With dead ends: 29071 [2024-11-21 22:05:40,539 INFO L226 Difference]: Without dead ends: 16103 [2024-11-21 22:05:40,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:40,544 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 289 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:40,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 368 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 22:05:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16103 states. [2024-11-21 22:05:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16103 to 10550. [2024-11-21 22:05:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10550 states, 10549 states have (on average 1.1117641482604985) internal successors, (11728), 10549 states have internal predecessors, (11728), 0 states have call successors, (0), 0 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-21 22:05:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 11728 transitions. [2024-11-21 22:05:40,634 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 11728 transitions. Word has length 354 [2024-11-21 22:05:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:40,634 INFO L471 AbstractCegarLoop]: Abstraction has 10550 states and 11728 transitions. [2024-11-21 22:05:40,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-21 22:05:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 11728 transitions. [2024-11-21 22:05:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-21 22:05:40,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:40,640 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:40,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 22:05:40,640 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:40,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1672122884, now seen corresponding path program 1 times [2024-11-21 22:05:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:40,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904681930] [2024-11-21 22:05:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-21 22:05:41,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904681930] [2024-11-21 22:05:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904681930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914144850] [2024-11-21 22:05:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:41,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:41,002 INFO L87 Difference]: Start difference. First operand 10550 states and 11728 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-21 22:05:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:41,685 INFO L93 Difference]: Finished difference Result 23312 states and 25815 transitions. [2024-11-21 22:05:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 367 [2024-11-21 22:05:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:41,696 INFO L225 Difference]: With dead ends: 23312 [2024-11-21 22:05:41,696 INFO L226 Difference]: Without dead ends: 12764 [2024-11-21 22:05:41,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:41,703 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 312 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:41,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 57 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2024-11-21 22:05:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 10177. [2024-11-21 22:05:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10177 states, 10176 states have (on average 1.1077044025157232) internal successors, (11272), 10176 states have internal predecessors, (11272), 0 states have call successors, (0), 0 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-21 22:05:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10177 states to 10177 states and 11272 transitions. [2024-11-21 22:05:41,863 INFO L78 Accepts]: Start accepts. Automaton has 10177 states and 11272 transitions. Word has length 367 [2024-11-21 22:05:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:41,864 INFO L471 AbstractCegarLoop]: Abstraction has 10177 states and 11272 transitions. [2024-11-21 22:05:41,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-21 22:05:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10177 states and 11272 transitions. [2024-11-21 22:05:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-21 22:05:41,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:41,874 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:41,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 22:05:41,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:41,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 555394427, now seen corresponding path program 1 times [2024-11-21 22:05:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049000495] [2024-11-21 22:05:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:41,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-21 22:05:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049000495] [2024-11-21 22:05:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049000495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:42,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44010247] [2024-11-21 22:05:42,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:42,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:42,200 INFO L87 Difference]: Start difference. First operand 10177 states and 11272 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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-21 22:05:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:43,051 INFO L93 Difference]: Finished difference Result 27179 states and 30081 transitions. [2024-11-21 22:05:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 402 [2024-11-21 22:05:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:43,073 INFO L225 Difference]: With dead ends: 27179 [2024-11-21 22:05:43,073 INFO L226 Difference]: Without dead ends: 17004 [2024-11-21 22:05:43,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:43,083 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 201 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:43,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 71 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:05:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2024-11-21 22:05:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 15891. [2024-11-21 22:05:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15891 states, 15890 states have (on average 1.1056639395846444) internal successors, (17569), 15890 states have internal predecessors, (17569), 0 states have call successors, (0), 0 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-21 22:05:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15891 states to 15891 states and 17569 transitions. [2024-11-21 22:05:43,221 INFO L78 Accepts]: Start accepts. Automaton has 15891 states and 17569 transitions. Word has length 402 [2024-11-21 22:05:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:43,221 INFO L471 AbstractCegarLoop]: Abstraction has 15891 states and 17569 transitions. [2024-11-21 22:05:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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-21 22:05:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15891 states and 17569 transitions. [2024-11-21 22:05:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-21 22:05:43,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:43,234 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 22:05:43,235 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1873288126, now seen corresponding path program 1 times [2024-11-21 22:05:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235263156] [2024-11-21 22:05:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-21 22:05:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235263156] [2024-11-21 22:05:43,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235263156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:43,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:43,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763277501] [2024-11-21 22:05:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:43,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:43,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:43,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:43,609 INFO L87 Difference]: Start difference. First operand 15891 states and 17569 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-21 22:05:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:44,487 INFO L93 Difference]: Finished difference Result 30497 states and 33716 transitions. [2024-11-21 22:05:44,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:44,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 547 [2024-11-21 22:05:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:44,502 INFO L225 Difference]: With dead ends: 30497 [2024-11-21 22:05:44,502 INFO L226 Difference]: Without dead ends: 17004 [2024-11-21 22:05:44,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:44,510 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:44,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 71 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:05:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2024-11-21 22:05:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 15707. [2024-11-21 22:05:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15707 states, 15706 states have (on average 1.1050553928434994) internal successors, (17356), 15706 states have internal predecessors, (17356), 0 states have call successors, (0), 0 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-21 22:05:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15707 states to 15707 states and 17356 transitions. [2024-11-21 22:05:44,637 INFO L78 Accepts]: Start accepts. Automaton has 15707 states and 17356 transitions. Word has length 547 [2024-11-21 22:05:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:44,637 INFO L471 AbstractCegarLoop]: Abstraction has 15707 states and 17356 transitions. [2024-11-21 22:05:44,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-21 22:05:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 15707 states and 17356 transitions. [2024-11-21 22:05:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-11-21 22:05:44,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:44,651 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:44,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 22:05:44,652 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:44,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1519719464, now seen corresponding path program 1 times [2024-11-21 22:05:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:44,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299771499] [2024-11-21 22:05:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:44,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-21 22:05:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299771499] [2024-11-21 22:05:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299771499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723123473] [2024-11-21 22:05:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:44,997 INFO L87 Difference]: Start difference. First operand 15707 states and 17356 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:45,518 INFO L93 Difference]: Finished difference Result 29218 states and 32305 transitions. [2024-11-21 22:05:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 561 [2024-11-21 22:05:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:45,535 INFO L225 Difference]: With dead ends: 29218 [2024-11-21 22:05:45,536 INFO L226 Difference]: Without dead ends: 15725 [2024-11-21 22:05:45,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:45,545 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 102 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:45,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 160 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:05:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15725 states. [2024-11-21 22:05:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15725 to 15339. [2024-11-21 22:05:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15339 states, 15338 states have (on average 1.0973399400182553) internal successors, (16831), 15338 states have internal predecessors, (16831), 0 states have call successors, (0), 0 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-21 22:05:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 16831 transitions. [2024-11-21 22:05:45,675 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 16831 transitions. Word has length 561 [2024-11-21 22:05:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:45,675 INFO L471 AbstractCegarLoop]: Abstraction has 15339 states and 16831 transitions. [2024-11-21 22:05:45,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 16831 transitions. [2024-11-21 22:05:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-11-21 22:05:45,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:45,686 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:45,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 22:05:45,687 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:45,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1808687197, now seen corresponding path program 1 times [2024-11-21 22:05:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:45,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981349961] [2024-11-21 22:05:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-21 22:05:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981349961] [2024-11-21 22:05:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981349961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:45,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177351683] [2024-11-21 22:05:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:45,903 INFO L87 Difference]: Start difference. First operand 15339 states and 16831 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-21 22:05:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:46,408 INFO L93 Difference]: Finished difference Result 31775 states and 34829 transitions. [2024-11-21 22:05:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 562 [2024-11-21 22:05:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:46,410 INFO L225 Difference]: With dead ends: 31775 [2024-11-21 22:05:46,410 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:05:46,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:46,421 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:46,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 127 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:05:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:05:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:05:46,422 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-21 22:05:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:05:46,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 562 [2024-11-21 22:05:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:46,423 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:05:46,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-21 22:05:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:05:46,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:05:46,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:05:46,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 22:05:46,429 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:46,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:05:53,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:05:53,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:05:53 BoogieIcfgContainer [2024-11-21 22:05:53,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:05:53,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:05:53,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:05:53,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:05:53,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:14" (3/4) ... [2024-11-21 22:05:53,226 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:05:53,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:05:53,253 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:05:53,254 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:05:53,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:05:53,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:05:53,417 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:05:53,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:05:53,418 INFO L158 Benchmark]: Toolchain (without parser) took 41978.63ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 960.5MB). Free memory was 75.7MB in the beginning and 543.2MB in the end (delta: -467.5MB). Peak memory consumption was 495.7MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,418 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:05:53,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 757.60ms. Allocated memory is still 151.0MB. Free memory was 75.7MB in the beginning and 83.4MB in the end (delta: -7.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.43ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 66.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,419 INFO L158 Benchmark]: Boogie Preprocessor took 252.40ms. Allocated memory is still 151.0MB. Free memory was 66.0MB in the beginning and 105.6MB in the end (delta: -39.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,419 INFO L158 Benchmark]: RCFGBuilder took 1582.30ms. Allocated memory was 151.0MB in the beginning and 257.9MB in the end (delta: 107.0MB). Free memory was 104.7MB in the beginning and 146.8MB in the end (delta: -42.1MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,419 INFO L158 Benchmark]: TraceAbstraction took 39058.32ms. Allocated memory was 257.9MB in the beginning and 1.1GB in the end (delta: 853.5MB). Free memory was 145.8MB in the beginning and 560.0MB in the end (delta: -414.2MB). Peak memory consumption was 700.1MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,420 INFO L158 Benchmark]: Witness Printer took 194.26ms. Allocated memory is still 1.1GB. Free memory was 560.0MB in the beginning and 543.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:05:53,421 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 151.0MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 757.60ms. Allocated memory is still 151.0MB. Free memory was 75.7MB in the beginning and 83.4MB in the end (delta: -7.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.43ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 66.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 252.40ms. Allocated memory is still 151.0MB. Free memory was 66.0MB in the beginning and 105.6MB in the end (delta: -39.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1582.30ms. Allocated memory was 151.0MB in the beginning and 257.9MB in the end (delta: 107.0MB). Free memory was 104.7MB in the beginning and 146.8MB in the end (delta: -42.1MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * TraceAbstraction took 39058.32ms. Allocated memory was 257.9MB in the beginning and 1.1GB in the end (delta: 853.5MB). Free memory was 145.8MB in the beginning and 560.0MB in the end (delta: -414.2MB). Peak memory consumption was 700.1MB. Max. memory is 16.1GB. * Witness Printer took 194.26ms. Allocated memory is still 1.1GB. Free memory was 560.0MB in the beginning and 543.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 151]: 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: 32.2s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4329 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4329 mSDsluCounter, 4986 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17194 IncrementalHoareTripleChecker+Invalid, 19338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2144 mSolverCounterUnsat, 4312 mSDtfsCounter, 17194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17789occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 24702 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 7510 NumberOfCodeBlocks, 7510 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7484 ConstructedInterpolants, 0 QuantifiedInterpolants, 23061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1222 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 7701/7924 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: ((((((((((((((((((((((((a25 <= 10) && (a4 == 1)) && (312 <= a23)) && (a29 <= 130)) || (((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 220))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((307 <= a23) && (a29 <= 599999)) && (a4 == 1)) && (a25 == 10))) || (((((long long) a23 + 43) <= 0) && (a25 == 11)) && (a29 <= 130))) || (((a25 == 13) && (a29 <= 599999)) && (a4 == 1))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 9))) || (((a4 == 0) && (a25 == 10)) && (a29 <= 130))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((((a25 == 13) && (a4 == 0)) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || (((a29 <= 275) && (a4 == 1)) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a29 <= 599999)) && (a25 == 9))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599999))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 10))) || (((a25 == 12) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599999)) && (a23 <= 137))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0))) || ((((((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) || ((((a29 <= 275) && (a25 <= 10)) && (a23 <= 262)) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) && (a29 <= 599999))) || (((a29 <= 599999) && (a25 == 9)) && (a4 == 1))) || ((((a29 <= 275) && (a4 == 0)) && (a25 == 11)) && (a23 <= 262))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:05:53,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE