./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label06.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 e7162a37b2481575f46ee042f017cf4130087aba4666f87e20be1f5306ddf30d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:20:48,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:20:48,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:20:48,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:20:48,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:20:49,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:20:49,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:20:49,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:20:49,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:20:49,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:20:49,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:20:49,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:20:49,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:20:49,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:20:49,012 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:20:49,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:20:49,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:20:49,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:20:49,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:20:49,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:20:49,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:20:49,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:20:49,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:20:49,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:20:49,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:20:49,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:20:49,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:20:49,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:20:49,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:20:49,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:20:49,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:20:49,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:20:49,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:20:49,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:20:49,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:20:49,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:20:49,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:20:49,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:20:49,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:20:49,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:20:49,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:20:49,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:20:49,026 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 -> e7162a37b2481575f46ee042f017cf4130087aba4666f87e20be1f5306ddf30d [2024-11-18 10:20:49,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:20:49,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:20:49,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:20:49,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:20:49,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:20:49,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label06.c [2024-11-18 10:20:50,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:20:51,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:20:51,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label06.c [2024-11-18 10:20:51,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80c84d37/bd8b94d10ec044b3ad20d1d900e5113b/FLAGeb3de08eb [2024-11-18 10:20:51,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80c84d37/bd8b94d10ec044b3ad20d1d900e5113b [2024-11-18 10:20:51,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:20:51,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:20:51,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:20:51,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:20:51,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:20:51,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:51,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439037a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51, skipping insertion in model container [2024-11-18 10:20:51,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:51,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:20:51,462 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_label06.c[9087,9100] [2024-11-18 10:20:51,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:20:51,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:20:51,702 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_label06.c[9087,9100] [2024-11-18 10:20:51,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:20:51,826 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:20:51,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51 WrapperNode [2024-11-18 10:20:51,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:20:51,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:20:51,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:20:51,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:20:51,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:51,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:51,980 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-18 10:20:51,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:20:51,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:20:51,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:20:51,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:20:51,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:51,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,063 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-18 10:20:52,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:20:52,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:20:52,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:20:52,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:20:52,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (1/1) ... [2024-11-18 10:20:52,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:20:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:52,212 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-18 10:20:52,219 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-18 10:20:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:20:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:20:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:20:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:20:52,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:20:52,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:20:53,940 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-18 10:20:53,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:20:53,965 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:20:53,967 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:20:53,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:53 BoogieIcfgContainer [2024-11-18 10:20:53,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:20:53,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:20:53,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:20:53,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:20:53,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:20:51" (1/3) ... [2024-11-18 10:20:53,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc2177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:20:53, skipping insertion in model container [2024-11-18 10:20:53,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:51" (2/3) ... [2024-11-18 10:20:53,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc2177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:20:53, skipping insertion in model container [2024-11-18 10:20:53,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:53" (3/3) ... [2024-11-18 10:20:53,980 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label06.c [2024-11-18 10:20:54,000 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:20:54,000 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:20:54,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:20:54,085 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;@60faa347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:20:54,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:20:54,091 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-18 10:20:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-18 10:20:54,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:54,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:54,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2024-11-18 10:20:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636814010] [2024-11-18 10:20:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:54,574 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-18 10:20:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:54,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636814010] [2024-11-18 10:20:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636814010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:54,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264511996] [2024-11-18 10:20:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:54,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:54,614 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 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-18 10:20:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:55,731 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-18 10:20:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:55,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-18 10:20:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:55,744 INFO L225 Difference]: With dead ends: 761 [2024-11-18 10:20:55,744 INFO L226 Difference]: Without dead ends: 413 [2024-11-18 10:20:55,748 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-18 10:20:55,751 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 165 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:55,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 10:20:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-18 10:20:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-18 10:20:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 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-18 10:20:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-18 10:20:55,818 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 63 [2024-11-18 10:20:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:55,819 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-18 10:20:55,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-18 10:20:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-18 10:20:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-18 10:20:55,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:55,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:55,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:20:55,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:55,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1774038808, now seen corresponding path program 1 times [2024-11-18 10:20:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983007897] [2024-11-18 10:20:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983007897] [2024-11-18 10:20:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983007897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80443537] [2024-11-18 10:20:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:56,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:56,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:56,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:56,168 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-18 10:20:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:56,923 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-18 10:20:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-11-18 10:20:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:56,928 INFO L225 Difference]: With dead ends: 1211 [2024-11-18 10:20:56,928 INFO L226 Difference]: Without dead ends: 800 [2024-11-18 10:20:56,929 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-18 10:20:56,931 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 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-18 10:20:56,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:20:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-18 10:20:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-18 10:20:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 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-18 10:20:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-18 10:20:56,968 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 131 [2024-11-18 10:20:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:56,969 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-18 10:20:56,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-18 10:20:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-18 10:20:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 10:20:56,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:56,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:20:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:20:56,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash -977289123, now seen corresponding path program 1 times [2024-11-18 10:20:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602721777] [2024-11-18 10:20:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602721777] [2024-11-18 10:20:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602721777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735616395] [2024-11-18 10:20:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:57,409 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-18 10:20:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:58,127 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-18 10:20:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-18 10:20:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:58,133 INFO L225 Difference]: With dead ends: 1945 [2024-11-18 10:20:58,133 INFO L226 Difference]: Without dead ends: 1158 [2024-11-18 10:20:58,135 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-18 10:20:58,136 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:58,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:20:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-18 10:20:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-18 10:20:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 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-18 10:20:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-18 10:20:58,168 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 133 [2024-11-18 10:20:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-18 10:20:58,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-18 10:20:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-18 10:20:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-18 10:20:58,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:58,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:20:58,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:20:58,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash -873825219, now seen corresponding path program 1 times [2024-11-18 10:20:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281816418] [2024-11-18 10:20:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:58,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:58,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281816418] [2024-11-18 10:20:58,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281816418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:58,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312801892] [2024-11-18 10:20:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:58,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:58,424 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-18 10:20:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:59,227 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-18 10:20:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2024-11-18 10:20:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:59,236 INFO L225 Difference]: With dead ends: 2519 [2024-11-18 10:20:59,236 INFO L226 Difference]: Without dead ends: 1548 [2024-11-18 10:20:59,238 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-18 10:20:59,239 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 172 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 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.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:59,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:20:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-18 10:20:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-18 10:20:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 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-18 10:20:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-18 10:20:59,267 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 190 [2024-11-18 10:20:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:59,268 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-18 10:20:59,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-18 10:20:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-18 10:20:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-18 10:20:59,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:59,273 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 10:20:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:20:59,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:59,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2127494464, now seen corresponding path program 1 times [2024-11-18 10:20:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509808414] [2024-11-18 10:20:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-18 10:20:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:59,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509808414] [2024-11-18 10:20:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509808414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:59,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135070158] [2024-11-18 10:20:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:59,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:59,642 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-18 10:21:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:00,460 INFO L93 Difference]: Finished difference Result 4009 states and 5316 transitions. [2024-11-18 10:21:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 245 [2024-11-18 10:21:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:00,469 INFO L225 Difference]: With dead ends: 4009 [2024-11-18 10:21:00,470 INFO L226 Difference]: Without dead ends: 2650 [2024-11-18 10:21:00,472 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-18 10:21:00,472 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 144 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:00,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 347 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:21:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2024-11-18 10:21:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2024-11-18 10:21:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2649 states have (on average 1.2431106077765195) internal successors, (3293), 2649 states have internal predecessors, (3293), 0 states have call successors, (0), 0 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-18 10:21:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3293 transitions. [2024-11-18 10:21:00,518 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3293 transitions. Word has length 245 [2024-11-18 10:21:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 2650 states and 3293 transitions. [2024-11-18 10:21:00,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-18 10:21:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3293 transitions. [2024-11-18 10:21:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-18 10:21:00,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:00,523 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:21:00,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:21:00,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:00,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash -468248497, now seen corresponding path program 1 times [2024-11-18 10:21:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579760819] [2024-11-18 10:21:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 25 proven. 96 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-18 10:21:01,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:01,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579760819] [2024-11-18 10:21:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579760819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:21:01,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666822942] [2024-11-18 10:21:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:01,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:21:01,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:21:01,070 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-18 10:21:01,074 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-18 10:21:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:01,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:21:01,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:21:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-18 10:21:01,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:21:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666822942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:21:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-18 10:21:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348820583] [2024-11-18 10:21:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:01,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 10:21:01,353 INFO L87 Difference]: Start difference. First operand 2650 states and 3293 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-18 10:21:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:02,206 INFO L93 Difference]: Finished difference Result 6228 states and 7865 transitions. [2024-11-18 10:21:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:02,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 251 [2024-11-18 10:21:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:02,222 INFO L225 Difference]: With dead ends: 6228 [2024-11-18 10:21:02,222 INFO L226 Difference]: Without dead ends: 3764 [2024-11-18 10:21:02,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 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-18 10:21:02,229 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 133 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:02,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 384 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:21:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2024-11-18 10:21:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3755. [2024-11-18 10:21:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.2192328183271177) internal successors, (4577), 3754 states have internal predecessors, (4577), 0 states have call successors, (0), 0 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-18 10:21:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4577 transitions. [2024-11-18 10:21:02,296 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4577 transitions. Word has length 251 [2024-11-18 10:21:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:02,297 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 4577 transitions. [2024-11-18 10:21:02,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-18 10:21:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4577 transitions. [2024-11-18 10:21:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-18 10:21:02,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:02,305 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:02,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 10:21:02,509 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,SelfDestructingSolverStorable5 [2024-11-18 10:21:02,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 496121255, now seen corresponding path program 1 times [2024-11-18 10:21:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313292161] [2024-11-18 10:21:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-18 10:21:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313292161] [2024-11-18 10:21:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313292161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:02,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:02,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908250464] [2024-11-18 10:21:02,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:02,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:02,776 INFO L87 Difference]: Start difference. First operand 3755 states and 4577 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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-18 10:21:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:03,558 INFO L93 Difference]: Finished difference Result 8442 states and 10451 transitions. [2024-11-18 10:21:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 322 [2024-11-18 10:21:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:03,576 INFO L225 Difference]: With dead ends: 8442 [2024-11-18 10:21:03,577 INFO L226 Difference]: Without dead ends: 4873 [2024-11-18 10:21:03,582 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-18 10:21:03,582 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:03,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 344 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:21:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-18 10:21:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4676. [2024-11-18 10:21:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4676 states, 4675 states have (on average 1.2094117647058824) internal successors, (5654), 4675 states have internal predecessors, (5654), 0 states have call successors, (0), 0 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-18 10:21:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 5654 transitions. [2024-11-18 10:21:03,662 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 5654 transitions. Word has length 322 [2024-11-18 10:21:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 4676 states and 5654 transitions. [2024-11-18 10:21:03,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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-18 10:21:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 5654 transitions. [2024-11-18 10:21:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-18 10:21:03,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:03,670 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-18 10:21:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:21:03,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1494112082, now seen corresponding path program 1 times [2024-11-18 10:21:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886550682] [2024-11-18 10:21:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-18 10:21:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886550682] [2024-11-18 10:21:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886550682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44628725] [2024-11-18 10:21:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:03,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:03,863 INFO L87 Difference]: Start difference. First operand 4676 states and 5654 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-18 10:21:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:04,602 INFO L93 Difference]: Finished difference Result 9326 states and 11272 transitions. [2024-11-18 10:21:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 325 [2024-11-18 10:21:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:04,622 INFO L225 Difference]: With dead ends: 9326 [2024-11-18 10:21:04,622 INFO L226 Difference]: Without dead ends: 4652 [2024-11-18 10:21:04,629 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-18 10:21:04,630 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:04,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 150 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:21:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2024-11-18 10:21:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4651. [2024-11-18 10:21:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4651 states, 4650 states have (on average 1.15247311827957) internal successors, (5359), 4650 states have internal predecessors, (5359), 0 states have call successors, (0), 0 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-18 10:21:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4651 states to 4651 states and 5359 transitions. [2024-11-18 10:21:04,713 INFO L78 Accepts]: Start accepts. Automaton has 4651 states and 5359 transitions. Word has length 325 [2024-11-18 10:21:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:04,713 INFO L471 AbstractCegarLoop]: Abstraction has 4651 states and 5359 transitions. [2024-11-18 10:21:04,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-18 10:21:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4651 states and 5359 transitions. [2024-11-18 10:21:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-11-18 10:21:04,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:04,724 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:04,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:21:04,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:04,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash -547751050, now seen corresponding path program 1 times [2024-11-18 10:21:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39599087] [2024-11-18 10:21:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:21:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39599087] [2024-11-18 10:21:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39599087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 10:21:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140294006] [2024-11-18 10:21:05,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:05,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:21:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:21:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:21:05,487 INFO L87 Difference]: Start difference. First operand 4651 states and 5359 transitions. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-18 10:21:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:06,614 INFO L93 Difference]: Finished difference Result 12640 states and 14697 transitions. [2024-11-18 10:21:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:21:06,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 388 [2024-11-18 10:21:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:06,642 INFO L225 Difference]: With dead ends: 12640 [2024-11-18 10:21:06,642 INFO L226 Difference]: Without dead ends: 7991 [2024-11-18 10:21:06,651 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-18 10:21:06,653 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 234 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:06,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 159 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 10:21:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2024-11-18 10:21:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 7435. [2024-11-18 10:21:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 7434 states have (on average 1.146758138283562) internal successors, (8525), 7434 states have internal predecessors, (8525), 0 states have call successors, (0), 0 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-18 10:21:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 8525 transitions. [2024-11-18 10:21:06,805 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 8525 transitions. Word has length 388 [2024-11-18 10:21:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:06,806 INFO L471 AbstractCegarLoop]: Abstraction has 7435 states and 8525 transitions. [2024-11-18 10:21:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-18 10:21:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 8525 transitions. [2024-11-18 10:21:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-18 10:21:06,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:06,827 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-18 10:21:06,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 10:21:06,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:06,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash -467739689, now seen corresponding path program 1 times [2024-11-18 10:21:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:06,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356191054] [2024-11-18 10:21:06,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 10:21:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356191054] [2024-11-18 10:21:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356191054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:21:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446781574] [2024-11-18 10:21:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:07,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:07,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:07,145 INFO L87 Difference]: Start difference. First operand 7435 states and 8525 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-18 10:21:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:07,515 INFO L93 Difference]: Finished difference Result 14862 states and 17042 transitions. [2024-11-18 10:21:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:07,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 403 [2024-11-18 10:21:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:07,534 INFO L225 Difference]: With dead ends: 14862 [2024-11-18 10:21:07,534 INFO L226 Difference]: Without dead ends: 7429 [2024-11-18 10:21:07,542 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-18 10:21:07,543 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:07,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 10:21:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2024-11-18 10:21:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7428. [2024-11-18 10:21:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7428 states, 7427 states have (on average 1.1460885956644675) internal successors, (8512), 7427 states have internal predecessors, (8512), 0 states have call successors, (0), 0 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-18 10:21:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 8512 transitions. [2024-11-18 10:21:07,651 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 8512 transitions. Word has length 403 [2024-11-18 10:21:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:07,652 INFO L471 AbstractCegarLoop]: Abstraction has 7428 states and 8512 transitions. [2024-11-18 10:21:07,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-18 10:21:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 8512 transitions. [2024-11-18 10:21:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-11-18 10:21:07,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:07,668 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:07,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:21:07,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1746481750, now seen corresponding path program 1 times [2024-11-18 10:21:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:07,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800490435] [2024-11-18 10:21:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-18 10:21:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800490435] [2024-11-18 10:21:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800490435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:08,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458934045] [2024-11-18 10:21:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:08,119 INFO L87 Difference]: Start difference. First operand 7428 states and 8512 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-18 10:21:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:08,786 INFO L93 Difference]: Finished difference Result 16714 states and 19129 transitions. [2024-11-18 10:21:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 435 [2024-11-18 10:21:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:08,803 INFO L225 Difference]: With dead ends: 16714 [2024-11-18 10:21:08,803 INFO L226 Difference]: Without dead ends: 9288 [2024-11-18 10:21:08,812 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-18 10:21:08,812 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:08,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 179 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:21:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2024-11-18 10:21:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 9084. [2024-11-18 10:21:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 9083 states have (on average 1.1353077177144115) internal successors, (10312), 9083 states have internal predecessors, (10312), 0 states have call successors, (0), 0 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-18 10:21:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 10312 transitions. [2024-11-18 10:21:09,019 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 10312 transitions. Word has length 435 [2024-11-18 10:21:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:09,020 INFO L471 AbstractCegarLoop]: Abstraction has 9084 states and 10312 transitions. [2024-11-18 10:21:09,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-18 10:21:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 10312 transitions. [2024-11-18 10:21:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-11-18 10:21:09,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:09,046 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:09,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 10:21:09,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:09,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1744296818, now seen corresponding path program 1 times [2024-11-18 10:21:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:09,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851034449] [2024-11-18 10:21:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-18 10:21:09,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851034449] [2024-11-18 10:21:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851034449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383308839] [2024-11-18 10:21:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:09,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:09,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:09,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:09,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:09,347 INFO L87 Difference]: Start difference. First operand 9084 states and 10312 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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-18 10:21:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:10,026 INFO L93 Difference]: Finished difference Result 20925 states and 23747 transitions. [2024-11-18 10:21:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:10,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 487 [2024-11-18 10:21:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:10,088 INFO L225 Difference]: With dead ends: 20925 [2024-11-18 10:21:10,088 INFO L226 Difference]: Without dead ends: 11107 [2024-11-18 10:21:10,094 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-18 10:21:10,095 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 65 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:10,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 350 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:21:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11107 states. [2024-11-18 10:21:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11107 to 10555. [2024-11-18 10:21:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10555 states, 10554 states have (on average 1.1255448171309457) internal successors, (11879), 10554 states have internal predecessors, (11879), 0 states have call successors, (0), 0 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-18 10:21:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10555 states to 10555 states and 11879 transitions. [2024-11-18 10:21:10,239 INFO L78 Accepts]: Start accepts. Automaton has 10555 states and 11879 transitions. Word has length 487 [2024-11-18 10:21:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:10,240 INFO L471 AbstractCegarLoop]: Abstraction has 10555 states and 11879 transitions. [2024-11-18 10:21:10,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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-18 10:21:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 10555 states and 11879 transitions. [2024-11-18 10:21:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-11-18 10:21:10,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:10,260 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:21:10,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 10:21:10,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -192105898, now seen corresponding path program 1 times [2024-11-18 10:21:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:10,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186010763] [2024-11-18 10:21:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 621 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-18 10:21:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186010763] [2024-11-18 10:21:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186010763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:10,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:10,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29822757] [2024-11-18 10:21:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:10,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:10,759 INFO L87 Difference]: Start difference. First operand 10555 states and 11879 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-18 10:21:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:11,572 INFO L93 Difference]: Finished difference Result 24423 states and 27490 transitions. [2024-11-18 10:21:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 527 [2024-11-18 10:21:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:11,597 INFO L225 Difference]: With dead ends: 24423 [2024-11-18 10:21:11,597 INFO L226 Difference]: Without dead ends: 13870 [2024-11-18 10:21:11,608 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-18 10:21:11,609 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:11,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 79 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:21:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2024-11-18 10:21:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13867. [2024-11-18 10:21:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13867 states, 13866 states have (on average 1.117914322803981) internal successors, (15501), 13866 states have internal predecessors, (15501), 0 states have call successors, (0), 0 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-18 10:21:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13867 states to 13867 states and 15501 transitions. [2024-11-18 10:21:11,792 INFO L78 Accepts]: Start accepts. Automaton has 13867 states and 15501 transitions. Word has length 527 [2024-11-18 10:21:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:11,792 INFO L471 AbstractCegarLoop]: Abstraction has 13867 states and 15501 transitions. [2024-11-18 10:21:11,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-18 10:21:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 13867 states and 15501 transitions. [2024-11-18 10:21:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-11-18 10:21:11,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:11,814 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:11,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 10:21:11,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2020315425, now seen corresponding path program 1 times [2024-11-18 10:21:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103587852] [2024-11-18 10:21:11,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 324 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-18 10:21:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103587852] [2024-11-18 10:21:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103587852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:21:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666079353] [2024-11-18 10:21:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:21:13,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:21:13,347 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-18 10:21:13,349 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-18 10:21:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:13,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:21:13,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:21:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-18 10:21:13,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:21:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666079353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:21:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-18 10:21:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088977431] [2024-11-18 10:21:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:13,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:13,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:21:13,752 INFO L87 Difference]: Start difference. First operand 13867 states and 15501 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-18 10:21:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:14,463 INFO L93 Difference]: Finished difference Result 16261 states and 18135 transitions. [2024-11-18 10:21:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:14,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 533 [2024-11-18 10:21:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:14,488 INFO L225 Difference]: With dead ends: 16261 [2024-11-18 10:21:14,488 INFO L226 Difference]: Without dead ends: 16259 [2024-11-18 10:21:14,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:21:14,495 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 158 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:14,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 137 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:21:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2024-11-18 10:21:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 13867. [2024-11-18 10:21:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13867 states, 13866 states have (on average 1.117842203952113) internal successors, (15500), 13866 states have internal predecessors, (15500), 0 states have call successors, (0), 0 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-18 10:21:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13867 states to 13867 states and 15500 transitions. [2024-11-18 10:21:14,673 INFO L78 Accepts]: Start accepts. Automaton has 13867 states and 15500 transitions. Word has length 533 [2024-11-18 10:21:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 13867 states and 15500 transitions. [2024-11-18 10:21:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-18 10:21:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13867 states and 15500 transitions. [2024-11-18 10:21:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-11-18 10:21:14,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:14,690 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:14,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 10:21:14,890 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,SelfDestructingSolverStorable13 [2024-11-18 10:21:14,892 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:14,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1051688403, now seen corresponding path program 1 times [2024-11-18 10:21:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:14,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397391029] [2024-11-18 10:21:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-18 10:21:15,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397391029] [2024-11-18 10:21:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397391029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 10:21:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858267821] [2024-11-18 10:21:15,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:15,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:21:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:15,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:21:15,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:21:15,964 INFO L87 Difference]: Start difference. First operand 13867 states and 15500 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-18 10:21:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:17,130 INFO L93 Difference]: Finished difference Result 30691 states and 34303 transitions. [2024-11-18 10:21:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:21:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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 551 [2024-11-18 10:21:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:17,155 INFO L225 Difference]: With dead ends: 30691 [2024-11-18 10:21:17,156 INFO L226 Difference]: Without dead ends: 16826 [2024-11-18 10:21:17,169 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-18 10:21:17,170 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 206 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:17,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 156 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 10:21:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16826 states. [2024-11-18 10:21:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16826 to 13681. [2024-11-18 10:21:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13681 states, 13680 states have (on average 1.1176169590643275) internal successors, (15289), 13680 states have internal predecessors, (15289), 0 states have call successors, (0), 0 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-18 10:21:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13681 states to 13681 states and 15289 transitions. [2024-11-18 10:21:17,354 INFO L78 Accepts]: Start accepts. Automaton has 13681 states and 15289 transitions. Word has length 551 [2024-11-18 10:21:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:17,355 INFO L471 AbstractCegarLoop]: Abstraction has 13681 states and 15289 transitions. [2024-11-18 10:21:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-18 10:21:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 13681 states and 15289 transitions. [2024-11-18 10:21:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2024-11-18 10:21:17,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:17,368 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-18 10:21:17,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 10:21:17,368 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash 720401217, now seen corresponding path program 1 times [2024-11-18 10:21:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834233482] [2024-11-18 10:21:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 834 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-18 10:21:18,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:18,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834233482] [2024-11-18 10:21:18,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834233482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:18,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:18,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 10:21:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261620191] [2024-11-18 10:21:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:18,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:21:18,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:18,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:21:18,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:21:18,011 INFO L87 Difference]: Start difference. First operand 13681 states and 15289 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-18 10:21:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:19,032 INFO L93 Difference]: Finished difference Result 32710 states and 36531 transitions. [2024-11-18 10:21:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:21:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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 581 [2024-11-18 10:21:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:19,059 INFO L225 Difference]: With dead ends: 32710 [2024-11-18 10:21:19,060 INFO L226 Difference]: Without dead ends: 19031 [2024-11-18 10:21:19,074 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-18 10:21:19,075 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 157 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:19,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 59 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 10:21:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2024-11-18 10:21:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 15333. [2024-11-18 10:21:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15333 states, 15332 states have (on average 1.1081398382468042) internal successors, (16990), 15332 states have internal predecessors, (16990), 0 states have call successors, (0), 0 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-18 10:21:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15333 states to 15333 states and 16990 transitions. [2024-11-18 10:21:19,375 INFO L78 Accepts]: Start accepts. Automaton has 15333 states and 16990 transitions. Word has length 581 [2024-11-18 10:21:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:19,376 INFO L471 AbstractCegarLoop]: Abstraction has 15333 states and 16990 transitions. [2024-11-18 10:21:19,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-18 10:21:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15333 states and 16990 transitions. [2024-11-18 10:21:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-11-18 10:21:19,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:19,393 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-18 10:21:19,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 10:21:19,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1947745532, now seen corresponding path program 1 times [2024-11-18 10:21:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:19,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711392591] [2024-11-18 10:21:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-18 10:21:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711392591] [2024-11-18 10:21:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711392591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:19,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621717502] [2024-11-18 10:21:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:21:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:21:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:21:19,842 INFO L87 Difference]: Start difference. First operand 15333 states and 16990 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-18 10:21:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:20,822 INFO L93 Difference]: Finished difference Result 39329 states and 43397 transitions. [2024-11-18 10:21:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:21:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 599 [2024-11-18 10:21:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:20,850 INFO L225 Difference]: With dead ends: 39329 [2024-11-18 10:21:20,850 INFO L226 Difference]: Without dead ends: 23998 [2024-11-18 10:21:20,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:21:20,868 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 160 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:20,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 67 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 10:21:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23998 states. [2024-11-18 10:21:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23998 to 22519. [2024-11-18 10:21:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22519 states, 22518 states have (on average 1.10134114930278) internal successors, (24800), 22518 states have internal predecessors, (24800), 0 states have call successors, (0), 0 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-18 10:21:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22519 states to 22519 states and 24800 transitions. [2024-11-18 10:21:21,218 INFO L78 Accepts]: Start accepts. Automaton has 22519 states and 24800 transitions. Word has length 599 [2024-11-18 10:21:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:21,218 INFO L471 AbstractCegarLoop]: Abstraction has 22519 states and 24800 transitions. [2024-11-18 10:21:21,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-18 10:21:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 22519 states and 24800 transitions. [2024-11-18 10:21:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2024-11-18 10:21:21,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:21,241 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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-18 10:21:21,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 10:21:21,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:21,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1631375320, now seen corresponding path program 1 times [2024-11-18 10:21:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893958921] [2024-11-18 10:21:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-11-18 10:21:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893958921] [2024-11-18 10:21:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893958921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656642611] [2024-11-18 10:21:21,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:21,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:21,526 INFO L87 Difference]: Start difference. First operand 22519 states and 24800 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-18 10:21:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:22,147 INFO L93 Difference]: Finished difference Result 45032 states and 49618 transitions. [2024-11-18 10:21:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:22,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 650 [2024-11-18 10:21:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:22,175 INFO L225 Difference]: With dead ends: 45032 [2024-11-18 10:21:22,176 INFO L226 Difference]: Without dead ends: 25095 [2024-11-18 10:21:22,192 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-18 10:21:22,193 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:22,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 113 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:21:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25095 states. [2024-11-18 10:21:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25095 to 22887. [2024-11-18 10:21:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22887 states, 22886 states have (on average 1.097876431005855) internal successors, (25126), 22886 states have internal predecessors, (25126), 0 states have call successors, (0), 0 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-18 10:21:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 25126 transitions. [2024-11-18 10:21:22,554 INFO L78 Accepts]: Start accepts. Automaton has 22887 states and 25126 transitions. Word has length 650 [2024-11-18 10:21:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:22,555 INFO L471 AbstractCegarLoop]: Abstraction has 22887 states and 25126 transitions. [2024-11-18 10:21:22,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-18 10:21:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 22887 states and 25126 transitions. [2024-11-18 10:21:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2024-11-18 10:21:22,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:22,578 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:21:22,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 10:21:22,579 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1057845284, now seen corresponding path program 1 times [2024-11-18 10:21:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261159095] [2024-11-18 10:21:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:22,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-18 10:21:22,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:22,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261159095] [2024-11-18 10:21:22,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261159095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:22,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:22,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113187284] [2024-11-18 10:21:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:22,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:22,915 INFO L87 Difference]: Start difference. First operand 22887 states and 25126 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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-18 10:21:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:23,490 INFO L93 Difference]: Finished difference Result 47243 states and 51839 transitions. [2024-11-18 10:21:23,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:23,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 683 [2024-11-18 10:21:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:23,516 INFO L225 Difference]: With dead ends: 47243 [2024-11-18 10:21:23,516 INFO L226 Difference]: Without dead ends: 24726 [2024-11-18 10:21:23,533 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-18 10:21:23,533 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 115 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:23,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 137 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:21:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24726 states. [2024-11-18 10:21:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24726 to 22327. [2024-11-18 10:21:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22327 states, 22326 states have (on average 1.0942846904953865) internal successors, (24431), 22326 states have internal predecessors, (24431), 0 states have call successors, (0), 0 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-18 10:21:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22327 states to 22327 states and 24431 transitions. [2024-11-18 10:21:23,925 INFO L78 Accepts]: Start accepts. Automaton has 22327 states and 24431 transitions. Word has length 683 [2024-11-18 10:21:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:23,926 INFO L471 AbstractCegarLoop]: Abstraction has 22327 states and 24431 transitions. [2024-11-18 10:21:23,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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-18 10:21:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22327 states and 24431 transitions. [2024-11-18 10:21:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2024-11-18 10:21:23,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:21:23,957 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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-18 10:21:23,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-18 10:21:23,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:21:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:21:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2044993265, now seen corresponding path program 1 times [2024-11-18 10:21:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:21:23,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187090049] [2024-11-18 10:21:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:21:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:21:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:21:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1777 backedges. 1159 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-18 10:21:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:21:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187090049] [2024-11-18 10:21:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187090049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:21:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:21:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:21:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926013373] [2024-11-18 10:21:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:21:24,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:21:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:21:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:21:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:21:24,629 INFO L87 Difference]: Start difference. First operand 22327 states and 24431 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-18 10:21:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:21:25,338 INFO L93 Difference]: Finished difference Result 43363 states and 47434 transitions. [2024-11-18 10:21:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:21:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 732 [2024-11-18 10:21:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:21:25,341 INFO L225 Difference]: With dead ends: 43363 [2024-11-18 10:21:25,341 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:21:25,356 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-18 10:21:25,357 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:21:25,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 338 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:21:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:21:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:21:25,358 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-18 10:21:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:21:25,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2024-11-18 10:21:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:21:25,359 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:21:25,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-18 10:21:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:21:25,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:21:25,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:21:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-18 10:21:25,365 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] [2024-11-18 10:21:25,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:21:30,875 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:21:30,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:21:30 BoogieIcfgContainer [2024-11-18 10:21:30,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:21:30,922 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:21:30,922 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:21:30,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:21:30,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:53" (3/4) ... [2024-11-18 10:21:30,929 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:21:30,964 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 10:21:30,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:21:30,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:21:30,967 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:21:31,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:21:31,144 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:21:31,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:21:31,144 INFO L158 Benchmark]: Toolchain (without parser) took 40044.92ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 93.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 300.6MB. Max. memory is 16.1GB. [2024-11-18 10:21:31,145 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 120.2MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:21:31,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.82ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 93.0MB in the beginning and 142.2MB in the end (delta: -49.2MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-18 10:21:31,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.59ms. Allocated memory is still 207.6MB. Free memory was 142.2MB in the beginning and 125.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 10:21:31,149 INFO L158 Benchmark]: Boogie Preprocessor took 193.41ms. Allocated memory is still 207.6MB. Free memory was 124.4MB in the beginning and 99.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-18 10:21:31,149 INFO L158 Benchmark]: RCFGBuilder took 1789.30ms. Allocated memory is still 207.6MB. Free memory was 99.2MB in the beginning and 108.6MB in the end (delta: -9.4MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-18 10:21:31,150 INFO L158 Benchmark]: TraceAbstraction took 36951.74ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 107.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-18 10:21:31,151 INFO L158 Benchmark]: Witness Printer took 222.00ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 10:21:31,152 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.19ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 120.2MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.82ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 93.0MB in the beginning and 142.2MB in the end (delta: -49.2MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.59ms. Allocated memory is still 207.6MB. Free memory was 142.2MB in the beginning and 125.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 193.41ms. Allocated memory is still 207.6MB. Free memory was 124.4MB in the beginning and 99.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1789.30ms. Allocated memory is still 207.6MB. Free memory was 99.2MB in the beginning and 108.6MB in the end (delta: -9.4MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36951.74ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 107.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 222.00ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB 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: 205]: 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: 31.3s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2863 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2863 mSDsluCounter, 3892 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 2002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12642 IncrementalHoareTripleChecker+Invalid, 14644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2002 mSolverCounterUnsat, 3426 mSDtfsCounter, 12642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22887occurred in iteration=18, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 16859 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 9013 NumberOfCodeBlocks, 9013 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 8991 ConstructedInterpolants, 0 QuantifiedInterpolants, 19855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 13232/13734 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 == 11) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29)) && (0 <= ((long long) a23 + 42))) || (((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a8 <= 15)) && (a29 <= 220)) && (a4 == 1))) || (((((a25 == 11) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || (((((139 <= a23) && (a8 <= 15)) && (a29 <= 599998)) && (a4 == 1)) && (a23 <= 312))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a8 <= 15)) && (a25 == 10))) || (((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a8 <= 15)) && (a23 <= 312)) && (13 <= a25))) || ((((a25 == 12) && (a8 <= 15)) && (((long long) 28470 + a29) <= 0)) && (a4 == 1))) || ((((a25 == 12) && (a4 == 0)) && (a8 <= 15)) && (a29 <= 599998))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312))) || (((((a25 == 12) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1)) && (a23 <= 312))) || ((((((a4 == 0) && (a25 == 11)) && (a8 <= 15)) && (a29 <= 599998)) && (a23 <= 312)) && (246 <= a29))) || (((a25 <= 10) && (a8 <= 15)) && (a4 == 1))) || (((((a25 == 12) && (a8 <= 15)) && (a4 == 1)) && (312 <= a23)) && (a29 <= 231))) || (((((a8 <= 15) && (a29 <= 599998)) && (a4 == 1)) && (312 <= a23)) && (246 <= a29))) || ((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a29 <= 599998)) && (246 <= a29))) || ((((a8 <= 15) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a8 <= 15)) && (((long long) 28470 + a29) <= 0))) || ((((a29 <= 274) && (a8 <= 15)) && (a4 == 1)) && (13 <= a25))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:21:31,185 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