./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.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 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 18:03:46,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:03:46,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:03:46,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:03:46,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:03:47,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:03:47,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:03:47,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:03:47,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:03:47,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:03:47,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:03:47,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:03:47,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:03:47,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:03:47,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:03:47,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:03:47,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:03:47,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:03:47,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:03:47,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:03:47,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:03:47,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:03:47,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:03:47,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:03:47,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:03:47,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:03:47,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:03:47,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:03:47,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:03:47,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:03:47,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:03:47,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:03:47,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:03:47,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:03:47,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:03:47,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:03:47,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:03:47,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:03:47,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:03:47,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:03:47,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:03:47,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:03:47,032 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 -> 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b [2024-11-19 18:03:47,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:03:47,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:03:47,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:03:47,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:03:47,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:03:47,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-11-19 18:03:48,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:03:49,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:03:49,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-11-19 18:03:49,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dff779dd/2a43b3377aa8408c9d0cef60b76fbf7d/FLAG1866f84ca [2024-11-19 18:03:49,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dff779dd/2a43b3377aa8408c9d0cef60b76fbf7d [2024-11-19 18:03:49,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:03:49,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:03:49,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:03:49,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:03:49,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:03:49,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:49,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ef246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49, skipping insertion in model container [2024-11-19 18:03:49,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:49,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:03:49,471 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_label44.c[3841,3854] [2024-11-19 18:03:49,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:03:49,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:03:49,843 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_label44.c[3841,3854] [2024-11-19 18:03:49,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:03:49,963 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:03:49,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49 WrapperNode [2024-11-19 18:03:49,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:03:49,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:03:49,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:03:49,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:03:49,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,119 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-19 18:03:50,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:03:50,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:03:50,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:03:50,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:03:50,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,218 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-19 18:03:50,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:03:50,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:03:50,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:03:50,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:03:50,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (1/1) ... [2024-11-19 18:03:50,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:03:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:03:50,356 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-19 18:03:50,358 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-19 18:03:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:03:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:03:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:03:50,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:03:50,464 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:03:50,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:03:52,089 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-19 18:03:52,089 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:03:52,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:03:52,115 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:03:52,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:52 BoogieIcfgContainer [2024-11-19 18:03:52,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:03:52,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:03:52,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:03:52,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:03:52,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:03:49" (1/3) ... [2024-11-19 18:03:52,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c33d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:03:52, skipping insertion in model container [2024-11-19 18:03:52,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:49" (2/3) ... [2024-11-19 18:03:52,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c33d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:03:52, skipping insertion in model container [2024-11-19 18:03:52,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:52" (3/3) ... [2024-11-19 18:03:52,129 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2024-11-19 18:03:52,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:03:52,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:03:52,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:03:52,229 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;@4b958774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:03:52,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:03:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:03:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 18:03:52,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:52,243 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] [2024-11-19 18:03:52,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:52,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2024-11-19 18:03:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:52,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081918801] [2024-11-19 18:03:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:52,617 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-19 18:03:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081918801] [2024-11-19 18:03:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081918801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:52,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:52,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893999096] [2024-11-19 18:03:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:52,675 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-19 18:03:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:53,912 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2024-11-19 18:03:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-19 18:03:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:53,927 INFO L225 Difference]: With dead ends: 763 [2024-11-19 18:03:53,928 INFO L226 Difference]: Without dead ends: 416 [2024-11-19 18:03:53,937 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-19 18:03:53,941 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:53,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 18:03:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-19 18:03:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-19 18:03:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 0 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-19 18:03:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2024-11-19 18:03:54,026 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 26 [2024-11-19 18:03:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:54,027 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2024-11-19 18:03:54,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-19 18:03:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2024-11-19 18:03:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 18:03:54,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:54,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:54,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:03:54,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:54,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1710179134, now seen corresponding path program 1 times [2024-11-19 18:03:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387732379] [2024-11-19 18:03:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387732379] [2024-11-19 18:03:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387732379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:54,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014587462] [2024-11-19 18:03:54,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:54,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:54,294 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-19 18:03:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:55,100 INFO L93 Difference]: Finished difference Result 1191 states and 1930 transitions. [2024-11-19 18:03:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:55,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-19 18:03:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:55,105 INFO L225 Difference]: With dead ends: 1191 [2024-11-19 18:03:55,105 INFO L226 Difference]: Without dead ends: 785 [2024-11-19 18:03:55,107 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-19 18:03:55,108 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:55,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 152 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:03:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-19 18:03:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2024-11-19 18:03:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.438618925831202) internal successors, (1125), 782 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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-19 18:03:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1125 transitions. [2024-11-19 18:03:55,152 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1125 transitions. Word has length 91 [2024-11-19 18:03:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:55,152 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1125 transitions. [2024-11-19 18:03:55,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-19 18:03:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1125 transitions. [2024-11-19 18:03:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 18:03:55,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:55,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:55,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:03:55,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash -308519566, now seen corresponding path program 1 times [2024-11-19 18:03:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172883437] [2024-11-19 18:03:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172883437] [2024-11-19 18:03:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172883437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:55,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749312136] [2024-11-19 18:03:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:55,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:55,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:55,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:55,351 INFO L87 Difference]: Start difference. First operand 783 states and 1125 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-19 18:03:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:56,018 INFO L93 Difference]: Finished difference Result 1948 states and 2801 transitions. [2024-11-19 18:03:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:56,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-19 18:03:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:56,025 INFO L225 Difference]: With dead ends: 1948 [2024-11-19 18:03:56,026 INFO L226 Difference]: Without dead ends: 1167 [2024-11-19 18:03:56,027 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-19 18:03:56,029 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:56,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-19 18:03:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2024-11-19 18:03:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3391153512575888) internal successors, (1544), 1153 states have internal predecessors, (1544), 0 states have call successors, (0), 0 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-19 18:03:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1544 transitions. [2024-11-19 18:03:56,059 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1544 transitions. Word has length 94 [2024-11-19 18:03:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:56,059 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1544 transitions. [2024-11-19 18:03:56,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-19 18:03:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1544 transitions. [2024-11-19 18:03:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 18:03:56,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:56,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:03:56,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1570751308, now seen corresponding path program 1 times [2024-11-19 18:03:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138005907] [2024-11-19 18:03:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138005907] [2024-11-19 18:03:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138005907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:56,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934953672] [2024-11-19 18:03:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:56,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:56,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:56,349 INFO L87 Difference]: Start difference. First operand 1154 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-19 18:03:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:57,079 INFO L93 Difference]: Finished difference Result 2676 states and 3529 transitions. [2024-11-19 18:03:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-19 18:03:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:57,085 INFO L225 Difference]: With dead ends: 2676 [2024-11-19 18:03:57,085 INFO L226 Difference]: Without dead ends: 1524 [2024-11-19 18:03:57,087 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-19 18:03:57,092 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:57,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-19 18:03:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2024-11-19 18:03:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.268725361366623) internal successors, (1931), 1522 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:03:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1931 transitions. [2024-11-19 18:03:57,121 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1931 transitions. Word has length 95 [2024-11-19 18:03:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:57,122 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1931 transitions. [2024-11-19 18:03:57,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-19 18:03:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1931 transitions. [2024-11-19 18:03:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 18:03:57,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:57,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:57,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:03:57,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:57,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1821693585, now seen corresponding path program 1 times [2024-11-19 18:03:57,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:57,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795030444] [2024-11-19 18:03:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795030444] [2024-11-19 18:03:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795030444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138620806] [2024-11-19 18:03:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:57,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:57,356 INFO L87 Difference]: Start difference. First operand 1523 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-19 18:03:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:58,120 INFO L93 Difference]: Finished difference Result 3968 states and 5151 transitions. [2024-11-19 18:03:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:58,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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 153 [2024-11-19 18:03:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:58,131 INFO L225 Difference]: With dead ends: 3968 [2024-11-19 18:03:58,131 INFO L226 Difference]: Without dead ends: 2631 [2024-11-19 18:03:58,134 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-19 18:03:58,135 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:58,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-11-19 18:03:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2447. [2024-11-19 18:03:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.2236304170073589) internal successors, (2993), 2446 states have internal predecessors, (2993), 0 states have call successors, (0), 0 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-19 18:03:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 2993 transitions. [2024-11-19 18:03:58,181 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 2993 transitions. Word has length 153 [2024-11-19 18:03:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:58,181 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 2993 transitions. [2024-11-19 18:03:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-19 18:03:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2993 transitions. [2024-11-19 18:03:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 18:03:58,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:58,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:58,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:03:58,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:58,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -935191055, now seen corresponding path program 1 times [2024-11-19 18:03:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751859821] [2024-11-19 18:03:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 18:03:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751859821] [2024-11-19 18:03:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751859821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810722232] [2024-11-19 18:03:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:58,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:58,383 INFO L87 Difference]: Start difference. First operand 2447 states and 2993 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-19 18:03:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:59,092 INFO L93 Difference]: Finished difference Result 5266 states and 6463 transitions. [2024-11-19 18:03:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 169 [2024-11-19 18:03:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:59,106 INFO L225 Difference]: With dead ends: 5266 [2024-11-19 18:03:59,107 INFO L226 Difference]: Without dead ends: 3005 [2024-11-19 18:03:59,110 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-19 18:03:59,112 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:59,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2024-11-19 18:03:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2820. [2024-11-19 18:03:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2819 states have (on average 1.2220645619013835) internal successors, (3445), 2819 states have internal predecessors, (3445), 0 states have call successors, (0), 0 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-19 18:03:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3445 transitions. [2024-11-19 18:03:59,180 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3445 transitions. Word has length 169 [2024-11-19 18:03:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:59,180 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 3445 transitions. [2024-11-19 18:03:59,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-19 18:03:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3445 transitions. [2024-11-19 18:03:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-19 18:03:59,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:59,186 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:03:59,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 18:03:59,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:59,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1559395122, now seen corresponding path program 1 times [2024-11-19 18:03:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:59,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56637727] [2024-11-19 18:03:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:59,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56637727] [2024-11-19 18:03:59,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56637727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:59,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:59,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754780106] [2024-11-19 18:03:59,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:59,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:59,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:59,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:59,411 INFO L87 Difference]: Start difference. First operand 2820 states and 3445 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-19 18:04:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:00,106 INFO L93 Difference]: Finished difference Result 6567 states and 8101 transitions. [2024-11-19 18:04:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-11-19 18:04:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:00,120 INFO L225 Difference]: With dead ends: 6567 [2024-11-19 18:04:00,121 INFO L226 Difference]: Without dead ends: 3933 [2024-11-19 18:04:00,125 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-19 18:04:00,127 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:00,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:04:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-11-19 18:04:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3556. [2024-11-19 18:04:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3556 states, 3555 states have (on average 1.2115330520393812) internal successors, (4307), 3555 states have internal predecessors, (4307), 0 states have call successors, (0), 0 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-19 18:04:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4307 transitions. [2024-11-19 18:04:00,211 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4307 transitions. Word has length 206 [2024-11-19 18:04:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 3556 states and 4307 transitions. [2024-11-19 18:04:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-19 18:04:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4307 transitions. [2024-11-19 18:04:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-19 18:04:00,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:00,214 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 18:04:00,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:04:00,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1693187880, now seen corresponding path program 1 times [2024-11-19 18:04:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512233667] [2024-11-19 18:04:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 18:04:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512233667] [2024-11-19 18:04:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512233667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:00,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:00,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858237401] [2024-11-19 18:04:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:00,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:00,472 INFO L87 Difference]: Start difference. First operand 3556 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-19 18:04:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:01,270 INFO L93 Difference]: Finished difference Result 9521 states and 11627 transitions. [2024-11-19 18:04:01,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:01,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 207 [2024-11-19 18:04:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:01,288 INFO L225 Difference]: With dead ends: 9521 [2024-11-19 18:04:01,288 INFO L226 Difference]: Without dead ends: 5967 [2024-11-19 18:04:01,294 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-19 18:04:01,295 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 200 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:01,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 332 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:04:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2024-11-19 18:04:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 5231. [2024-11-19 18:04:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5230 states have (on average 1.2061185468451243) internal successors, (6308), 5230 states have internal predecessors, (6308), 0 states have call successors, (0), 0 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-19 18:04:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6308 transitions. [2024-11-19 18:04:01,418 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6308 transitions. Word has length 207 [2024-11-19 18:04:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 5231 states and 6308 transitions. [2024-11-19 18:04:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-19 18:04:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6308 transitions. [2024-11-19 18:04:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-19 18:04:01,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:01,424 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:01,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:04:01,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash 192944744, now seen corresponding path program 1 times [2024-11-19 18:04:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309469598] [2024-11-19 18:04:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:04:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:01,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309469598] [2024-11-19 18:04:01,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309469598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:01,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:01,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225426555] [2024-11-19 18:04:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:01,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:01,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:01,661 INFO L87 Difference]: Start difference. First operand 5231 states and 6308 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-19 18:04:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:02,370 INFO L93 Difference]: Finished difference Result 10457 states and 12611 transitions. [2024-11-19 18:04:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-11-19 18:04:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:02,386 INFO L225 Difference]: With dead ends: 10457 [2024-11-19 18:04:02,386 INFO L226 Difference]: Without dead ends: 5228 [2024-11-19 18:04:02,393 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-19 18:04:02,393 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:02,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:04:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2024-11-19 18:04:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2024-11-19 18:04:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5227 states have (on average 1.178687583700019) internal successors, (6161), 5227 states have internal predecessors, (6161), 0 states have call successors, (0), 0 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-19 18:04:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 6161 transitions. [2024-11-19 18:04:02,539 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 6161 transitions. Word has length 244 [2024-11-19 18:04:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:02,540 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 6161 transitions. [2024-11-19 18:04:02,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-19 18:04:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 6161 transitions. [2024-11-19 18:04:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-19 18:04:02,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:02,546 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:02,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:04:02,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1616620059, now seen corresponding path program 1 times [2024-11-19 18:04:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802318864] [2024-11-19 18:04:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 18:04:02,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802318864] [2024-11-19 18:04:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802318864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:02,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:02,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501618372] [2024-11-19 18:04:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:02,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:02,837 INFO L87 Difference]: Start difference. First operand 5228 states and 6161 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-19 18:04:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:03,462 INFO L93 Difference]: Finished difference Result 11195 states and 13196 transitions. [2024-11-19 18:04:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 258 [2024-11-19 18:04:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:03,494 INFO L225 Difference]: With dead ends: 11195 [2024-11-19 18:04:03,494 INFO L226 Difference]: Without dead ends: 5969 [2024-11-19 18:04:03,504 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-19 18:04:03,504 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 196 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:03,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 148 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:04:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2024-11-19 18:04:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 5228. [2024-11-19 18:04:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5227 states have (on average 1.178687583700019) internal successors, (6161), 5227 states have internal predecessors, (6161), 0 states have call successors, (0), 0 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-19 18:04:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 6161 transitions. [2024-11-19 18:04:03,646 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 6161 transitions. Word has length 258 [2024-11-19 18:04:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:03,647 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 6161 transitions. [2024-11-19 18:04:03,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-19 18:04:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 6161 transitions. [2024-11-19 18:04:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-19 18:04:03,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:03,652 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 18:04:03,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 292208959, now seen corresponding path program 1 times [2024-11-19 18:04:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378103651] [2024-11-19 18:04:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 18:04:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378103651] [2024-11-19 18:04:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378103651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702348480] [2024-11-19 18:04:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:04,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:04:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:04:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:04:04,096 INFO L87 Difference]: Start difference. First operand 5228 states and 6161 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:04:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:05,517 INFO L93 Difference]: Finished difference Result 15807 states and 18813 transitions. [2024-11-19 18:04:05,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:04:05,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2024-11-19 18:04:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:05,544 INFO L225 Difference]: With dead ends: 15807 [2024-11-19 18:04:05,545 INFO L226 Difference]: Without dead ends: 10581 [2024-11-19 18:04:05,552 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-19 18:04:05,553 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:05,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 116 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 18:04:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10581 states. [2024-11-19 18:04:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10581 to 10019. [2024-11-19 18:04:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10019 states, 10018 states have (on average 1.1802755040926332) internal successors, (11824), 10018 states have internal predecessors, (11824), 0 states have call successors, (0), 0 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-19 18:04:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 11824 transitions. [2024-11-19 18:04:05,691 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 11824 transitions. Word has length 261 [2024-11-19 18:04:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:05,692 INFO L471 AbstractCegarLoop]: Abstraction has 10019 states and 11824 transitions. [2024-11-19 18:04:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:04:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 11824 transitions. [2024-11-19 18:04:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-19 18:04:05,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:05,698 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:04:05,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 18:04:05,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:05,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash -271673639, now seen corresponding path program 1 times [2024-11-19 18:04:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559290109] [2024-11-19 18:04:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:04:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559290109] [2024-11-19 18:04:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559290109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623222736] [2024-11-19 18:04:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:06,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:04:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:06,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:04:06,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:04:06,024 INFO L87 Difference]: Start difference. First operand 10019 states and 11824 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-19 18:04:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:07,214 INFO L93 Difference]: Finished difference Result 25580 states and 30141 transitions. [2024-11-19 18:04:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:04:07,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2024-11-19 18:04:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:07,246 INFO L225 Difference]: With dead ends: 25580 [2024-11-19 18:04:07,246 INFO L226 Difference]: Without dead ends: 15931 [2024-11-19 18:04:07,259 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-19 18:04:07,260 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 258 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:07,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 77 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 18:04:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15931 states. [2024-11-19 18:04:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15931 to 15745. [2024-11-19 18:04:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15745 states, 15744 states have (on average 1.1689532520325203) internal successors, (18404), 15744 states have internal predecessors, (18404), 0 states have call successors, (0), 0 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-19 18:04:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15745 states to 15745 states and 18404 transitions. [2024-11-19 18:04:07,484 INFO L78 Accepts]: Start accepts. Automaton has 15745 states and 18404 transitions. Word has length 270 [2024-11-19 18:04:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 15745 states and 18404 transitions. [2024-11-19 18:04:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-19 18:04:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15745 states and 18404 transitions. [2024-11-19 18:04:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-19 18:04:07,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:07,490 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 18:04:07,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2010794811, now seen corresponding path program 1 times [2024-11-19 18:04:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710381817] [2024-11-19 18:04:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-19 18:04:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710381817] [2024-11-19 18:04:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710381817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:07,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929094018] [2024-11-19 18:04:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:07,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:07,741 INFO L87 Difference]: Start difference. First operand 15745 states and 18404 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-19 18:04:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:08,474 INFO L93 Difference]: Finished difference Result 32403 states and 37950 transitions. [2024-11-19 18:04:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:08,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2024-11-19 18:04:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:08,505 INFO L225 Difference]: With dead ends: 32403 [2024-11-19 18:04:08,505 INFO L226 Difference]: Without dead ends: 18136 [2024-11-19 18:04:08,522 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-19 18:04:08,523 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 193 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:08,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:04:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18136 states. [2024-11-19 18:04:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18136 to 13160. [2024-11-19 18:04:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 13159 states have (on average 1.172201535071054) internal successors, (15425), 13159 states have internal predecessors, (15425), 0 states have call successors, (0), 0 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-19 18:04:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 15425 transitions. [2024-11-19 18:04:08,840 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 15425 transitions. Word has length 281 [2024-11-19 18:04:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:08,841 INFO L471 AbstractCegarLoop]: Abstraction has 13160 states and 15425 transitions. [2024-11-19 18:04:08,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-19 18:04:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 15425 transitions. [2024-11-19 18:04:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-19 18:04:08,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:08,850 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 18:04:08,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:08,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1064230659, now seen corresponding path program 1 times [2024-11-19 18:04:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503059175] [2024-11-19 18:04:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 18:04:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503059175] [2024-11-19 18:04:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503059175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298905199] [2024-11-19 18:04:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:09,097 INFO L87 Difference]: Start difference. First operand 13160 states and 15425 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-19 18:04:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:09,759 INFO L93 Difference]: Finished difference Result 28713 states and 33938 transitions. [2024-11-19 18:04:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 301 [2024-11-19 18:04:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:09,789 INFO L225 Difference]: With dead ends: 28713 [2024-11-19 18:04:09,790 INFO L226 Difference]: Without dead ends: 15923 [2024-11-19 18:04:09,805 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-19 18:04:09,806 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:09,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 159 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:04:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-11-19 18:04:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 13145. [2024-11-19 18:04:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13145 states, 13144 states have (on average 1.1517802799756542) internal successors, (15139), 13144 states have internal predecessors, (15139), 0 states have call successors, (0), 0 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-19 18:04:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13145 states to 13145 states and 15139 transitions. [2024-11-19 18:04:10,081 INFO L78 Accepts]: Start accepts. Automaton has 13145 states and 15139 transitions. Word has length 301 [2024-11-19 18:04:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:10,082 INFO L471 AbstractCegarLoop]: Abstraction has 13145 states and 15139 transitions. [2024-11-19 18:04:10,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-19 18:04:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 13145 states and 15139 transitions. [2024-11-19 18:04:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-19 18:04:10,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:10,089 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:10,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 18:04:10,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:10,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1313485887, now seen corresponding path program 1 times [2024-11-19 18:04:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754312013] [2024-11-19 18:04:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 18:04:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754312013] [2024-11-19 18:04:10,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754312013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:10,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:10,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:04:10,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506364438] [2024-11-19 18:04:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:10,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:10,273 INFO L87 Difference]: Start difference. First operand 13145 states and 15139 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-19 18:04:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:10,672 INFO L93 Difference]: Finished difference Result 25172 states and 28967 transitions. [2024-11-19 18:04:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:10,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 308 [2024-11-19 18:04:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:10,693 INFO L225 Difference]: With dead ends: 25172 [2024-11-19 18:04:10,693 INFO L226 Difference]: Without dead ends: 12397 [2024-11-19 18:04:10,704 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-19 18:04:10,704 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:10,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 37 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 18:04:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2024-11-19 18:04:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 12395. [2024-11-19 18:04:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12395 states, 12394 states have (on average 1.1461190898822011) internal successors, (14205), 12394 states have internal predecessors, (14205), 0 states have call successors, (0), 0 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-19 18:04:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 14205 transitions. [2024-11-19 18:04:10,851 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 14205 transitions. Word has length 308 [2024-11-19 18:04:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 12395 states and 14205 transitions. [2024-11-19 18:04:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-19 18:04:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 14205 transitions. [2024-11-19 18:04:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-19 18:04:10,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:10,861 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-19 18:04:10,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 18:04:10,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:10,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1486952426, now seen corresponding path program 1 times [2024-11-19 18:04:10,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597975882] [2024-11-19 18:04:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-19 18:04:11,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:11,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597975882] [2024-11-19 18:04:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597975882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:11,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:11,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:11,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503323405] [2024-11-19 18:04:11,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:11,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:11,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:11,209 INFO L87 Difference]: Start difference. First operand 12395 states and 14205 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-19 18:04:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:11,872 INFO L93 Difference]: Finished difference Result 27738 states and 31821 transitions. [2024-11-19 18:04:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:11,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 330 [2024-11-19 18:04:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:11,893 INFO L225 Difference]: With dead ends: 27738 [2024-11-19 18:04:11,893 INFO L226 Difference]: Without dead ends: 15713 [2024-11-19 18:04:11,904 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-19 18:04:11,905 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 179 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:11,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 357 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:04:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15713 states. [2024-11-19 18:04:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15713 to 13687. [2024-11-19 18:04:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13687 states, 13686 states have (on average 1.1304983194505334) internal successors, (15472), 13686 states have internal predecessors, (15472), 0 states have call successors, (0), 0 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-19 18:04:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 15472 transitions. [2024-11-19 18:04:12,115 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 15472 transitions. Word has length 330 [2024-11-19 18:04:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:12,115 INFO L471 AbstractCegarLoop]: Abstraction has 13687 states and 15472 transitions. [2024-11-19 18:04:12,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-19 18:04:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 15472 transitions. [2024-11-19 18:04:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-19 18:04:12,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:04:12,125 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 18:04:12,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:04:12,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:04:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash -842788195, now seen corresponding path program 1 times [2024-11-19 18:04:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:04:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643413352] [2024-11-19 18:04:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:04:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:04:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:04:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-19 18:04:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:04:12,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643413352] [2024-11-19 18:04:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643413352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:04:12,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:04:12,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:04:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152824666] [2024-11-19 18:04:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:04:12,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:04:12,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:04:12,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:04:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:04:12,312 INFO L87 Difference]: Start difference. First operand 13687 states and 15472 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-19 18:04:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:04:12,989 INFO L93 Difference]: Finished difference Result 27922 states and 31577 transitions. [2024-11-19 18:04:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:04:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 337 [2024-11-19 18:04:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:04:12,991 INFO L225 Difference]: With dead ends: 27922 [2024-11-19 18:04:12,991 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 18:04:13,004 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-19 18:04:13,004 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 188 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:04:13,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 305 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:04:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 18:04:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 18:04:13,005 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-19 18:04:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 18:04:13,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 337 [2024-11-19 18:04:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:04:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 18:04:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-19 18:04:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 18:04:13,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 18:04:13,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 18:04:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 18:04:13,017 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:04:13,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 18:04:15,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 18:04:15,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:04:15 BoogieIcfgContainer [2024-11-19 18:04:15,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 18:04:15,616 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 18:04:15,616 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 18:04:15,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 18:04:15,617 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:52" (3/4) ... [2024-11-19 18:04:15,619 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 18:04:15,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 18:04:15,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 18:04:15,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 18:04:15,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 18:04:15,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 18:04:15,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 18:04:15,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 18:04:15,801 INFO L158 Benchmark]: Toolchain (without parser) took 26640.05ms. Allocated memory was 146.8MB in the beginning and 1.0GB in the end (delta: 859.8MB). Free memory was 74.7MB in the beginning and 801.9MB in the end (delta: -727.2MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,801 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 18:04:15,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.14ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 74.5MB in the beginning and 156.6MB in the end (delta: -82.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.54ms. Allocated memory is still 216.0MB. Free memory was 156.6MB in the beginning and 139.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,803 INFO L158 Benchmark]: Boogie Preprocessor took 197.30ms. Allocated memory is still 216.0MB. Free memory was 139.7MB in the beginning and 113.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,803 INFO L158 Benchmark]: RCFGBuilder took 1796.39ms. Allocated memory is still 216.0MB. Free memory was 113.7MB in the beginning and 100.6MB in the end (delta: 13.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,804 INFO L158 Benchmark]: TraceAbstraction took 23494.90ms. Allocated memory was 216.0MB in the beginning and 1.0GB in the end (delta: 790.6MB). Free memory was 99.5MB in the beginning and 818.7MB in the end (delta: -719.2MB). Peak memory consumption was 637.7MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,804 INFO L158 Benchmark]: Witness Printer took 184.42ms. Allocated memory is still 1.0GB. Free memory was 818.7MB in the beginning and 801.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 18:04:15,805 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.21ms. Allocated memory is still 146.8MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.14ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 74.5MB in the beginning and 156.6MB in the end (delta: -82.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.54ms. Allocated memory is still 216.0MB. Free memory was 156.6MB in the beginning and 139.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 197.30ms. Allocated memory is still 216.0MB. Free memory was 139.7MB in the beginning and 113.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1796.39ms. Allocated memory is still 216.0MB. Free memory was 113.7MB in the beginning and 100.6MB in the end (delta: 13.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23494.90ms. Allocated memory was 216.0MB in the beginning and 1.0GB in the end (delta: 790.6MB). Free memory was 99.5MB in the beginning and 818.7MB in the end (delta: -719.2MB). Peak memory consumption was 637.7MB. Max. memory is 16.1GB. * Witness Printer took 184.42ms. Allocated memory is still 1.0GB. Free memory was 818.7MB in the beginning and 801.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2937 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2937 mSDsluCounter, 3171 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 1677 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10066 IncrementalHoareTripleChecker+Invalid, 11743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1677 mSolverCounterUnsat, 2792 mSDtfsCounter, 10066 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15745occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 12777 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3631 NumberOfCodeBlocks, 3631 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3614 ConstructedInterpolants, 0 QuantifiedInterpolants, 7340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2190/2190 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((a4 == 1) && (a8 == 15)) && (247 <= a29)) || (((10 <= a25) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || (((((10 <= a25) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15)) && (247 <= a29))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15))) || (((a25 == 12) && (a4 == 0)) && (a8 == 15))) || (((a23 <= 138) && (a4 == 1)) && (a8 == 15))) || (((a29 <= 140) && (a4 == 1)) && (a8 == 15))) || ((((262 <= a29) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) || (((307 <= a23) && (a4 == 1)) && (a8 == 15))) || ((((10 <= a25) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) RESULT: Ultimate proved your program to be correct! [2024-11-19 18:04:15,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE