./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label47.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:51:13,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:51:13,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:51:13,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:51:13,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:51:13,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:51:13,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:51:13,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:51:13,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:51:13,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:51:13,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:51:13,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:51:13,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:51:13,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:51:13,197 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:51:13,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:51:13,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:51:13,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:51:13,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:51:13,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:51:13,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:51:13,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:51:13,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:51:13,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:51:13,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:51:13,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:51:13,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:51:13,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:51:13,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:51:13,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:51:13,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:51:13,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:51:13,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:51:13,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:51:13,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:51:13,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:51:13,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:51:13,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:51:13,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:51:13,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:51:13,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:51:13,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:51:13,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea [2024-11-16 03:51:13,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:51:13,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:51:13,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:51:13,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:51:13,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:51:13,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-11-16 03:51:14,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:51:15,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:51:15,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-11-16 03:51:15,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc38e673/c23a09cc13134d08ab62ad7e6ccefdde/FLAG1962fc071 [2024-11-16 03:51:15,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc38e673/c23a09cc13134d08ab62ad7e6ccefdde [2024-11-16 03:51:15,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:51:15,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:51:15,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:51:15,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:51:15,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:51:15,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:15,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d0988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15, skipping insertion in model container [2024-11-16 03:51:15,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:15,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:51:15,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c[5129,5142] [2024-11-16 03:51:15,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:51:15,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:51:15,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c[5129,5142] [2024-11-16 03:51:15,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:51:15,945 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:51:15,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15 WrapperNode [2024-11-16 03:51:15,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:51:15,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:51:15,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:51:15,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:51:15,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:15,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,040 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-16 03:51:16,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:51:16,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:51:16,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:51:16,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:51:16,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,113 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-16 03:51:16,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:51:16,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:51:16,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:51:16,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:51:16,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (1/1) ... [2024-11-16 03:51:16,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:51:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:51:16,204 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-16 03:51:16,206 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-16 03:51:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:51:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:51:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:51:16,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:51:16,303 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:51:16,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:51:17,570 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-16 03:51:17,571 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:51:17,592 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:51:17,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:51:17,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:51:17 BoogieIcfgContainer [2024-11-16 03:51:17,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:51:17,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:51:17,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:51:17,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:51:17,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:51:15" (1/3) ... [2024-11-16 03:51:17,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a3fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:51:17, skipping insertion in model container [2024-11-16 03:51:17,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:51:15" (2/3) ... [2024-11-16 03:51:17,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a3fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:51:17, skipping insertion in model container [2024-11-16 03:51:17,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:51:17" (3/3) ... [2024-11-16 03:51:17,606 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2024-11-16 03:51:17,624 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:51:17,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:51:17,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:51:17,693 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;@24e08a2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:51:17,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:51:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 1.7077464788732395) internal successors, (485), 285 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-16 03:51:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 03:51:17,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:17,705 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] [2024-11-16 03:51:17,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:17,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash -839218611, now seen corresponding path program 1 times [2024-11-16 03:51:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:17,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978424174] [2024-11-16 03:51:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:17,987 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-16 03:51:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978424174] [2024-11-16 03:51:17,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978424174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:17,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:17,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:51:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543164729] [2024-11-16 03:51:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:18,016 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 1.7077464788732395) internal successors, (485), 285 states have internal predecessors, (485), 0 states have call successors, (0), 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 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-16 03:51:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:18,888 INFO L93 Difference]: Finished difference Result 775 states and 1366 transitions. [2024-11-16 03:51:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:18,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-16 03:51:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:18,905 INFO L225 Difference]: With dead ends: 775 [2024-11-16 03:51:18,907 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:51:18,910 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-16 03:51:18,913 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 205 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:18,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 168 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:51:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:51:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 415. [2024-11-16 03:51:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5193236714975846) internal successors, (629), 414 states have internal predecessors, (629), 0 states have call successors, (0), 0 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-16 03:51:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 629 transitions. [2024-11-16 03:51:18,968 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 629 transitions. Word has length 37 [2024-11-16 03:51:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 629 transitions. [2024-11-16 03:51:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-16 03:51:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 629 transitions. [2024-11-16 03:51:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 03:51:18,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:18,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:51:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:51:18,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1824907797, now seen corresponding path program 1 times [2024-11-16 03:51:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912014556] [2024-11-16 03:51:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:51:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912014556] [2024-11-16 03:51:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912014556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:51:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123649022] [2024-11-16 03:51:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:19,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:19,127 INFO L87 Difference]: Start difference. First operand 415 states and 629 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-16 03:51:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:19,816 INFO L93 Difference]: Finished difference Result 1207 states and 1837 transitions. [2024-11-16 03:51:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-16 03:51:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:19,820 INFO L225 Difference]: With dead ends: 1207 [2024-11-16 03:51:19,820 INFO L226 Difference]: Without dead ends: 794 [2024-11-16 03:51:19,822 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-16 03:51:19,823 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:19,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 180 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:51:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-16 03:51:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2024-11-16 03:51:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.3720050441361917) internal successors, (1088), 793 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:51:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1088 transitions. [2024-11-16 03:51:19,847 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1088 transitions. Word has length 104 [2024-11-16 03:51:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:19,847 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1088 transitions. [2024-11-16 03:51:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-16 03:51:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1088 transitions. [2024-11-16 03:51:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 03:51:19,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:19,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:51:19,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:51:19,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:19,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1063972513, now seen corresponding path program 1 times [2024-11-16 03:51:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002833873] [2024-11-16 03:51:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:51:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002833873] [2024-11-16 03:51:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002833873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:51:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439136839] [2024-11-16 03:51:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:20,144 INFO L87 Difference]: Start difference. First operand 794 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-16 03:51:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:20,764 INFO L93 Difference]: Finished difference Result 2328 states and 3195 transitions. [2024-11-16 03:51:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-16 03:51:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:20,769 INFO L225 Difference]: With dead ends: 2328 [2024-11-16 03:51:20,769 INFO L226 Difference]: Without dead ends: 1536 [2024-11-16 03:51:20,770 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-16 03:51:20,771 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 119 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:20,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 197 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:51:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-16 03:51:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1535. [2024-11-16 03:51:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.2157757496740547) internal successors, (1865), 1534 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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-16 03:51:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1865 transitions. [2024-11-16 03:51:20,815 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1865 transitions. Word has length 108 [2024-11-16 03:51:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:20,815 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 1865 transitions. [2024-11-16 03:51:20,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-16 03:51:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1865 transitions. [2024-11-16 03:51:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-16 03:51:20,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:20,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:51:20,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:51:20,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:20,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1335070600, now seen corresponding path program 1 times [2024-11-16 03:51:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:20,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762682232] [2024-11-16 03:51:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:51:21,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:21,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762682232] [2024-11-16 03:51:21,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762682232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:21,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:21,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89262539] [2024-11-16 03:51:21,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:21,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:21,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:21,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:21,009 INFO L87 Difference]: Start difference. First operand 1535 states and 1865 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-16 03:51:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:21,652 INFO L93 Difference]: Finished difference Result 3276 states and 4142 transitions. [2024-11-16 03:51:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-16 03:51:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:21,661 INFO L225 Difference]: With dead ends: 3276 [2024-11-16 03:51:21,661 INFO L226 Difference]: Without dead ends: 1928 [2024-11-16 03:51:21,664 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-16 03:51:21,665 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 200 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:21,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 327 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:51:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-16 03:51:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-16 03:51:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.2448024948024947) internal successors, (2395), 1924 states have internal predecessors, (2395), 0 states have call successors, (0), 0 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-16 03:51:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2395 transitions. [2024-11-16 03:51:21,702 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2395 transitions. Word has length 165 [2024-11-16 03:51:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:21,703 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2395 transitions. [2024-11-16 03:51:21,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-16 03:51:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2395 transitions. [2024-11-16 03:51:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-16 03:51:21,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:21,709 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:51:21,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash -354466278, now seen corresponding path program 1 times [2024-11-16 03:51:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564986307] [2024-11-16 03:51:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-16 03:51:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564986307] [2024-11-16 03:51:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564986307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151118207] [2024-11-16 03:51:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:21,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:21,903 INFO L87 Difference]: Start difference. First operand 1925 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-16 03:51:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:22,579 INFO L93 Difference]: Finished difference Result 4414 states and 5615 transitions. [2024-11-16 03:51:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 221 [2024-11-16 03:51:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:22,587 INFO L225 Difference]: With dead ends: 4414 [2024-11-16 03:51:22,587 INFO L226 Difference]: Without dead ends: 2676 [2024-11-16 03:51:22,589 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-16 03:51:22,590 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:22,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 397 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:51:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-16 03:51:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2481. [2024-11-16 03:51:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.2334677419354838) internal successors, (3059), 2480 states have internal predecessors, (3059), 0 states have call successors, (0), 0 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-16 03:51:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3059 transitions. [2024-11-16 03:51:22,627 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3059 transitions. Word has length 221 [2024-11-16 03:51:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:22,628 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3059 transitions. [2024-11-16 03:51:22,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-16 03:51:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3059 transitions. [2024-11-16 03:51:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-16 03:51:22,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:22,631 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:22,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:51:22,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:22,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -39044407, now seen corresponding path program 1 times [2024-11-16 03:51:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834644976] [2024-11-16 03:51:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-16 03:51:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834644976] [2024-11-16 03:51:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834644976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:22,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:22,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380048329] [2024-11-16 03:51:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:22,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:22,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:22,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:22,836 INFO L87 Difference]: Start difference. First operand 2481 states and 3059 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-16 03:51:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:23,525 INFO L93 Difference]: Finished difference Result 5895 states and 7330 transitions. [2024-11-16 03:51:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-16 03:51:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:23,534 INFO L225 Difference]: With dead ends: 5895 [2024-11-16 03:51:23,534 INFO L226 Difference]: Without dead ends: 3416 [2024-11-16 03:51:23,536 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-16 03:51:23,536 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 161 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:23,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 395 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:51:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-11-16 03:51:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3407. [2024-11-16 03:51:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3406 states have (on average 1.2066940692894892) internal successors, (4110), 3406 states have internal predecessors, (4110), 0 states have call successors, (0), 0 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-16 03:51:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4110 transitions. [2024-11-16 03:51:23,577 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4110 transitions. Word has length 227 [2024-11-16 03:51:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:23,578 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 4110 transitions. [2024-11-16 03:51:23,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-16 03:51:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 4110 transitions. [2024-11-16 03:51:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-16 03:51:23,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:23,582 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:51:23,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:51:23,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash -831886593, now seen corresponding path program 1 times [2024-11-16 03:51:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441294869] [2024-11-16 03:51:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-16 03:51:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441294869] [2024-11-16 03:51:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441294869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577489080] [2024-11-16 03:51:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:23,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:23,784 INFO L87 Difference]: Start difference. First operand 3407 states and 4110 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-16 03:51:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:24,396 INFO L93 Difference]: Finished difference Result 6826 states and 8243 transitions. [2024-11-16 03:51:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:24,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 299 [2024-11-16 03:51:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:24,406 INFO L225 Difference]: With dead ends: 6826 [2024-11-16 03:51:24,406 INFO L226 Difference]: Without dead ends: 3421 [2024-11-16 03:51:24,410 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-16 03:51:24,412 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:24,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 340 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:51:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2024-11-16 03:51:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3037. [2024-11-16 03:51:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.1805006587615283) internal successors, (3584), 3036 states have internal predecessors, (3584), 0 states have call successors, (0), 0 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-16 03:51:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 3584 transitions. [2024-11-16 03:51:24,455 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 3584 transitions. Word has length 299 [2024-11-16 03:51:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:24,456 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 3584 transitions. [2024-11-16 03:51:24,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-16 03:51:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 3584 transitions. [2024-11-16 03:51:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-16 03:51:24,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:24,460 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 03:51:24,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:51:24,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:24,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1599452307, now seen corresponding path program 1 times [2024-11-16 03:51:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109337871] [2024-11-16 03:51:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-16 03:51:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109337871] [2024-11-16 03:51:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109337871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:24,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:24,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017873873] [2024-11-16 03:51:24,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:24,609 INFO L87 Difference]: Start difference. First operand 3037 states and 3584 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-16 03:51:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:25,178 INFO L93 Difference]: Finished difference Result 6049 states and 7133 transitions. [2024-11-16 03:51:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:25,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2024-11-16 03:51:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:25,186 INFO L225 Difference]: With dead ends: 6049 [2024-11-16 03:51:25,186 INFO L226 Difference]: Without dead ends: 3014 [2024-11-16 03:51:25,189 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-16 03:51:25,190 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 162 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:25,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 152 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:51:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2024-11-16 03:51:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2024-11-16 03:51:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.132181999335769) internal successors, (3409), 3011 states have internal predecessors, (3409), 0 states have call successors, (0), 0 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-16 03:51:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3409 transitions. [2024-11-16 03:51:25,228 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3409 transitions. Word has length 300 [2024-11-16 03:51:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 3012 states and 3409 transitions. [2024-11-16 03:51:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-16 03:51:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3409 transitions. [2024-11-16 03:51:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-16 03:51:25,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:25,233 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:51:25,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 966825966, now seen corresponding path program 1 times [2024-11-16 03:51:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838014871] [2024-11-16 03:51:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-16 03:51:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838014871] [2024-11-16 03:51:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838014871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352857500] [2024-11-16 03:51:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:25,405 INFO L87 Difference]: Start difference. First operand 3012 states and 3409 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-16 03:51:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:25,942 INFO L93 Difference]: Finished difference Result 6946 states and 7849 transitions. [2024-11-16 03:51:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:25,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 305 [2024-11-16 03:51:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:25,952 INFO L225 Difference]: With dead ends: 6946 [2024-11-16 03:51:25,953 INFO L226 Difference]: Without dead ends: 3936 [2024-11-16 03:51:25,956 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-16 03:51:25,958 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 187 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:25,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 149 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:51:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2024-11-16 03:51:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 2081. [2024-11-16 03:51:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2080 states have (on average 1.1471153846153845) internal successors, (2386), 2080 states have internal predecessors, (2386), 0 states have call successors, (0), 0 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-16 03:51:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2386 transitions. [2024-11-16 03:51:25,994 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2386 transitions. Word has length 305 [2024-11-16 03:51:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:25,994 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 2386 transitions. [2024-11-16 03:51:25,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-16 03:51:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2386 transitions. [2024-11-16 03:51:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-16 03:51:25,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:25,998 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:51:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:51:25,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:26,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash 43037533, now seen corresponding path program 1 times [2024-11-16 03:51:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532690444] [2024-11-16 03:51:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:51:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532690444] [2024-11-16 03:51:26,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532690444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:26,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:26,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:51:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702902833] [2024-11-16 03:51:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:51:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:51:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:51:26,322 INFO L87 Difference]: Start difference. First operand 2081 states and 2386 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-16 03:51:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:27,270 INFO L93 Difference]: Finished difference Result 6389 states and 7328 transitions. [2024-11-16 03:51:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:51:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2024-11-16 03:51:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:27,286 INFO L225 Difference]: With dead ends: 6389 [2024-11-16 03:51:27,286 INFO L226 Difference]: Without dead ends: 4310 [2024-11-16 03:51:27,289 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-16 03:51:27,290 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 265 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:27,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 73 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 03:51:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2024-11-16 03:51:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 3753. [2024-11-16 03:51:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 1.1300639658848615) internal successors, (4240), 3752 states have internal predecessors, (4240), 0 states have call successors, (0), 0 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-16 03:51:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 4240 transitions. [2024-11-16 03:51:27,338 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 4240 transitions. Word has length 344 [2024-11-16 03:51:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 4240 transitions. [2024-11-16 03:51:27,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-16 03:51:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 4240 transitions. [2024-11-16 03:51:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-16 03:51:27,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:27,346 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:51:27,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1553383827, now seen corresponding path program 1 times [2024-11-16 03:51:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759871862] [2024-11-16 03:51:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-16 03:51:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759871862] [2024-11-16 03:51:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759871862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:51:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662980808] [2024-11-16 03:51:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:51:27,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:51:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:51:27,714 INFO L87 Difference]: Start difference. First operand 3753 states and 4240 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-16 03:51:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:28,610 INFO L93 Difference]: Finished difference Result 8801 states and 9921 transitions. [2024-11-16 03:51:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:51:28,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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 419 [2024-11-16 03:51:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:28,631 INFO L225 Difference]: With dead ends: 8801 [2024-11-16 03:51:28,631 INFO L226 Difference]: Without dead ends: 5050 [2024-11-16 03:51:28,638 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-16 03:51:28,639 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 265 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:28,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 73 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:51:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2024-11-16 03:51:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 3753. [2024-11-16 03:51:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 1.1300639658848615) internal successors, (4240), 3752 states have internal predecessors, (4240), 0 states have call successors, (0), 0 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-16 03:51:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 4240 transitions. [2024-11-16 03:51:28,692 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 4240 transitions. Word has length 419 [2024-11-16 03:51:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:28,693 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 4240 transitions. [2024-11-16 03:51:28,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-16 03:51:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 4240 transitions. [2024-11-16 03:51:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2024-11-16 03:51:28,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:28,705 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-16 03:51:28,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:51:28,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:28,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash -481867967, now seen corresponding path program 1 times [2024-11-16 03:51:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:28,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371961226] [2024-11-16 03:51:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:28,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 847 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-16 03:51:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:29,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371961226] [2024-11-16 03:51:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371961226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:29,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666475406] [2024-11-16 03:51:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:29,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:51:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:51:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:51:29,162 INFO L87 Difference]: Start difference. First operand 3753 states and 4240 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-16 03:51:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:30,022 INFO L93 Difference]: Finished difference Result 11965 states and 13540 transitions. [2024-11-16 03:51:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:51:30,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 672 [2024-11-16 03:51:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:30,033 INFO L225 Difference]: With dead ends: 11965 [2024-11-16 03:51:30,034 INFO L226 Difference]: Without dead ends: 8214 [2024-11-16 03:51:30,038 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-16 03:51:30,039 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 224 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:30,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 90 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:51:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2024-11-16 03:51:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 7842. [2024-11-16 03:51:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7842 states, 7841 states have (on average 1.1187348552480552) internal successors, (8772), 7841 states have internal predecessors, (8772), 0 states have call successors, (0), 0 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-16 03:51:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7842 states to 7842 states and 8772 transitions. [2024-11-16 03:51:30,121 INFO L78 Accepts]: Start accepts. Automaton has 7842 states and 8772 transitions. Word has length 672 [2024-11-16 03:51:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:30,121 INFO L471 AbstractCegarLoop]: Abstraction has 7842 states and 8772 transitions. [2024-11-16 03:51:30,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-16 03:51:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7842 states and 8772 transitions. [2024-11-16 03:51:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2024-11-16 03:51:30,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:30,134 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:30,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:51:30,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1274866401, now seen corresponding path program 1 times [2024-11-16 03:51:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944290981] [2024-11-16 03:51:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-11-16 03:51:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944290981] [2024-11-16 03:51:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944290981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314435696] [2024-11-16 03:51:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:30,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:30,469 INFO L87 Difference]: Start difference. First operand 7842 states and 8772 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-16 03:51:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:31,139 INFO L93 Difference]: Finished difference Result 17532 states and 19650 transitions. [2024-11-16 03:51:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 741 [2024-11-16 03:51:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:31,153 INFO L225 Difference]: With dead ends: 17532 [2024-11-16 03:51:31,153 INFO L226 Difference]: Without dead ends: 8765 [2024-11-16 03:51:31,161 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-16 03:51:31,161 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 197 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:31,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 367 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:51:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2024-11-16 03:51:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 8765. [2024-11-16 03:51:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 8764 states have (on average 1.1000684618895482) internal successors, (9641), 8764 states have internal predecessors, (9641), 0 states have call successors, (0), 0 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-16 03:51:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 9641 transitions. [2024-11-16 03:51:31,258 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 9641 transitions. Word has length 741 [2024-11-16 03:51:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:31,259 INFO L471 AbstractCegarLoop]: Abstraction has 8765 states and 9641 transitions. [2024-11-16 03:51:31,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-16 03:51:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 9641 transitions. [2024-11-16 03:51:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2024-11-16 03:51:31,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:51:31,273 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:31,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:51:31,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:51:31,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:51:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1180679647, now seen corresponding path program 1 times [2024-11-16 03:51:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:51:31,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812057333] [2024-11-16 03:51:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:51:31,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:51:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:51:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 1448 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-16 03:51:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:51:31,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812057333] [2024-11-16 03:51:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812057333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:51:31,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:51:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:51:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705796362] [2024-11-16 03:51:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:51:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:51:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:51:31,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:51:31,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:51:31,617 INFO L87 Difference]: Start difference. First operand 8765 states and 9641 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-16 03:51:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:51:32,097 INFO L93 Difference]: Finished difference Result 18264 states and 20058 transitions. [2024-11-16 03:51:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:51:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 841 [2024-11-16 03:51:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:51:32,099 INFO L225 Difference]: With dead ends: 18264 [2024-11-16 03:51:32,099 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:51:32,109 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-16 03:51:32,110 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:51:32,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 329 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:51:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:51:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:51:32,112 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-16 03:51:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:51:32,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 841 [2024-11-16 03:51:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:51:32,112 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:51:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-16 03:51:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:51:32,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:51:32,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:51:32,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:51:32,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:51:32,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:51:33,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:51:33,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:51:33 BoogieIcfgContainer [2024-11-16 03:51:33,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:51:33,094 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:51:33,094 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:51:33,094 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:51:33,095 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:51:17" (3/4) ... [2024-11-16 03:51:33,097 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:51:33,115 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:51:33,116 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:51:33,117 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:51:33,118 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:51:33,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:51:33,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:51:33,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:51:33,253 INFO L158 Benchmark]: Toolchain (without parser) took 17910.55ms. Allocated memory was 140.5MB in the beginning and 478.2MB in the end (delta: 337.6MB). Free memory was 66.6MB in the beginning and 271.7MB in the end (delta: -205.1MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,253 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:51:33,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.05ms. Allocated memory is still 140.5MB. Free memory was 66.4MB in the beginning and 78.4MB in the end (delta: -12.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.48ms. Allocated memory is still 140.5MB. Free memory was 78.4MB in the beginning and 60.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,254 INFO L158 Benchmark]: Boogie Preprocessor took 134.97ms. Allocated memory is still 140.5MB. Free memory was 60.7MB in the beginning and 89.2MB in the end (delta: -28.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,254 INFO L158 Benchmark]: IcfgBuilder took 1419.82ms. Allocated memory was 140.5MB in the beginning and 182.5MB in the end (delta: 41.9MB). Free memory was 89.2MB in the beginning and 77.8MB in the end (delta: 11.5MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,254 INFO L158 Benchmark]: TraceAbstraction took 15495.08ms. Allocated memory was 182.5MB in the beginning and 478.2MB in the end (delta: 295.7MB). Free memory was 76.7MB in the beginning and 289.6MB in the end (delta: -212.9MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,254 INFO L158 Benchmark]: Witness Printer took 158.61ms. Allocated memory is still 478.2MB. Free memory was 289.6MB in the beginning and 271.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 03:51:33,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.05ms. Allocated memory is still 140.5MB. Free memory was 66.4MB in the beginning and 78.4MB in the end (delta: -12.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.48ms. Allocated memory is still 140.5MB. Free memory was 78.4MB in the beginning and 60.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.97ms. Allocated memory is still 140.5MB. Free memory was 60.7MB in the beginning and 89.2MB in the end (delta: -28.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * IcfgBuilder took 1419.82ms. Allocated memory was 140.5MB in the beginning and 182.5MB in the end (delta: 41.9MB). Free memory was 89.2MB in the beginning and 77.8MB in the end (delta: 11.5MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15495.08ms. Allocated memory was 182.5MB in the beginning and 478.2MB in the end (delta: 295.7MB). Free memory was 76.7MB in the beginning and 289.6MB in the end (delta: -212.9MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. * Witness Printer took 158.61ms. Allocated memory is still 478.2MB. Free memory was 289.6MB in the beginning and 271.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2505 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2505 mSDsluCounter, 3237 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 1728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9188 IncrementalHoareTripleChecker+Invalid, 10916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1728 mSolverCounterUnsat, 2837 mSDtfsCounter, 9188 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8765occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 4685 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4783 NumberOfCodeBlocks, 4783 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4769 ConstructedInterpolants, 0 QuantifiedInterpolants, 8251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6824/6824 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]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:51:33,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE