./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label19.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 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:21:54,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:21:54,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:21:54,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:21:54,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:21:54,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:21:54,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:21:54,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:21:54,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:21:54,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:21:54,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:21:54,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:21:54,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:21:54,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:21:54,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:21:54,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:21:54,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:21:54,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:21:54,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:21:54,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:21:54,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:21:54,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:21:54,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:21:54,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:21:54,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:21:54,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:21:54,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:21:54,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:21:54,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:21:54,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:21:54,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:21:54,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:21:54,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:21:54,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:21:54,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:21:54,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:21:54,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:21:54,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:21:54,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:21:54,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:21:54,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:21:54,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:21:54,423 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 -> 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 [2024-11-09 19:21:54,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:21:54,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:21:54,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:21:54,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:21:54,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:21:54,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-11-09 19:21:56,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:21:56,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:21:56,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-11-09 19:21:56,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777328426/ed383e89be194bccbe1b959501c8cbb2/FLAGc9570ef8b [2024-11-09 19:21:56,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777328426/ed383e89be194bccbe1b959501c8cbb2 [2024-11-09 19:21:56,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:21:56,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:21:56,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:21:56,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:21:56,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:21:56,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:56,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d25e2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56, skipping insertion in model container [2024-11-09 19:21:56,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:56,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:21:56,595 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_label19.c[8142,8155] [2024-11-09 19:21:56,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:21:56,747 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:21:56,787 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_label19.c[8142,8155] [2024-11-09 19:21:56,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:21:56,884 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:21:56,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56 WrapperNode [2024-11-09 19:21:56,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:21:56,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:21:56,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:21:56,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:21:56,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:56,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:56,986 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:21:56,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:21:56,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:21:56,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:21:56,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:21:56,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:56,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,105 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-09 19:21:57,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:21:57,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:21:57,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:21:57,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:21:57,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (1/1) ... [2024-11-09 19:21:57,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:21:57,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:57,229 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-09 19:21:57,230 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-09 19:21:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:21:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:21:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:21:57,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:21:57,322 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:21:57,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:21:58,885 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:21:58,885 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:21:58,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:21:58,906 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:21:58,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:58 BoogieIcfgContainer [2024-11-09 19:21:58,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:21:58,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:21:58,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:21:58,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:21:58,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:21:56" (1/3) ... [2024-11-09 19:21:58,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb5b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:21:58, skipping insertion in model container [2024-11-09 19:21:58,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:56" (2/3) ... [2024-11-09 19:21:58,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb5b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:21:58, skipping insertion in model container [2024-11-09 19:21:58,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:58" (3/3) ... [2024-11-09 19:21:58,914 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19.c [2024-11-09 19:21:58,926 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:21:58,926 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:21:58,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:21:58,988 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;@5b37f2ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:21:58,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:21:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 19:21:59,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:59,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:59,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -315883539, now seen corresponding path program 1 times [2024-11-09 19:21:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882156702] [2024-11-09 19:21:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:59,355 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-09 19:21:59,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882156702] [2024-11-09 19:21:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882156702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889256396] [2024-11-09 19:21:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:59,432 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:00,493 INFO L93 Difference]: Finished difference Result 769 states and 1715 transitions. [2024-11-09 19:22:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-09 19:22:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:00,506 INFO L225 Difference]: With dead ends: 769 [2024-11-09 19:22:00,506 INFO L226 Difference]: Without dead ends: 419 [2024-11-09 19:22:00,509 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-09 19:22:00,511 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 336 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:00,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 92 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:22:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-09 19:22:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2024-11-09 19:22:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 2.1902439024390246) internal successors, (898), 410 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 898 transitions. [2024-11-09 19:22:00,558 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 898 transitions. Word has length 58 [2024-11-09 19:22:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:00,559 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 898 transitions. [2024-11-09 19:22:00,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 898 transitions. [2024-11-09 19:22:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 19:22:00,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:00,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:00,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:22:00,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:00,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1907550761, now seen corresponding path program 1 times [2024-11-09 19:22:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:00,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120686295] [2024-11-09 19:22:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120686295] [2024-11-09 19:22:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120686295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198904233] [2024-11-09 19:22:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:00,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:00,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:00,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:00,675 INFO L87 Difference]: Start difference. First operand 411 states and 898 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:01,553 INFO L93 Difference]: Finished difference Result 1197 states and 2644 transitions. [2024-11-09 19:22:01,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:01,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-09 19:22:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:01,557 INFO L225 Difference]: With dead ends: 1197 [2024-11-09 19:22:01,557 INFO L226 Difference]: Without dead ends: 788 [2024-11-09 19:22:01,558 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-09 19:22:01,559 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 296 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:01,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 155 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:22:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-09 19:22:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2024-11-09 19:22:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 2.044472681067344) internal successors, (1609), 787 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1609 transitions. [2024-11-09 19:22:01,580 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1609 transitions. Word has length 124 [2024-11-09 19:22:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:01,581 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1609 transitions. [2024-11-09 19:22:01,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1609 transitions. [2024-11-09 19:22:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 19:22:01,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:01,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:01,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:22:01,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:01,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash 81365811, now seen corresponding path program 1 times [2024-11-09 19:22:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:01,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709921364] [2024-11-09 19:22:01,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:01,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:01,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:01,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709921364] [2024-11-09 19:22:01,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709921364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:01,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:01,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727318817] [2024-11-09 19:22:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:01,790 INFO L87 Difference]: Start difference. First operand 788 states and 1609 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:02,683 INFO L93 Difference]: Finished difference Result 1954 states and 4005 transitions. [2024-11-09 19:22:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-09 19:22:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:02,687 INFO L225 Difference]: With dead ends: 1954 [2024-11-09 19:22:02,687 INFO L226 Difference]: Without dead ends: 1168 [2024-11-09 19:22:02,688 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-09 19:22:02,689 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 263 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:02,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 178 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:22:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-09 19:22:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1158. [2024-11-09 19:22:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.9524632670700086) internal successors, (2259), 1157 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2259 transitions. [2024-11-09 19:22:02,709 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2259 transitions. Word has length 127 [2024-11-09 19:22:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:02,710 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 2259 transitions. [2024-11-09 19:22:02,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2259 transitions. [2024-11-09 19:22:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 19:22:02,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:02,713 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:02,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:22:02,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash 342715549, now seen corresponding path program 1 times [2024-11-09 19:22:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362277536] [2024-11-09 19:22:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362277536] [2024-11-09 19:22:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362277536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147814870] [2024-11-09 19:22:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:03,071 INFO L87 Difference]: Start difference. First operand 1158 states and 2259 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:04,455 INFO L93 Difference]: Finished difference Result 3432 states and 6694 transitions. [2024-11-09 19:22:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 19:22:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:04,463 INFO L225 Difference]: With dead ends: 3432 [2024-11-09 19:22:04,463 INFO L226 Difference]: Without dead ends: 2276 [2024-11-09 19:22:04,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:22:04,465 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 845 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:04,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 223 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:22:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2024-11-09 19:22:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1902. [2024-11-09 19:22:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 1.8721725407680168) internal successors, (3559), 1901 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 3559 transitions. [2024-11-09 19:22:04,496 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 3559 transitions. Word has length 128 [2024-11-09 19:22:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 3559 transitions. [2024-11-09 19:22:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3559 transitions. [2024-11-09 19:22:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 19:22:04,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:04,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:22:04,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:22:04,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:04,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash -215094489, now seen corresponding path program 1 times [2024-11-09 19:22:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:04,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559996896] [2024-11-09 19:22:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:04,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 19:22:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559996896] [2024-11-09 19:22:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559996896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010367230] [2024-11-09 19:22:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:04,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:04,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:04,717 INFO L87 Difference]: Start difference. First operand 1902 states and 3559 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:05,423 INFO L93 Difference]: Finished difference Result 4734 states and 8772 transitions. [2024-11-09 19:22:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:05,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-11-09 19:22:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:05,431 INFO L225 Difference]: With dead ends: 4734 [2024-11-09 19:22:05,431 INFO L226 Difference]: Without dead ends: 2834 [2024-11-09 19:22:05,432 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-09 19:22:05,433 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 194 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:05,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2024-11-09 19:22:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2648. [2024-11-09 19:22:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2647 states have (on average 1.842840952021156) internal successors, (4878), 2647 states have internal predecessors, (4878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 4878 transitions. [2024-11-09 19:22:05,461 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 4878 transitions. Word has length 202 [2024-11-09 19:22:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 4878 transitions. [2024-11-09 19:22:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 4878 transitions. [2024-11-09 19:22:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 19:22:05,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:05,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 19:22:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:22:05,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1203230661, now seen corresponding path program 1 times [2024-11-09 19:22:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029819538] [2024-11-09 19:22:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029819538] [2024-11-09 19:22:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029819538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111250392] [2024-11-09 19:22:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:05,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:05,764 INFO L87 Difference]: Start difference. First operand 2648 states and 4878 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:06,500 INFO L93 Difference]: Finished difference Result 6227 states and 11553 transitions. [2024-11-09 19:22:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2024-11-09 19:22:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:06,510 INFO L225 Difference]: With dead ends: 6227 [2024-11-09 19:22:06,510 INFO L226 Difference]: Without dead ends: 3766 [2024-11-09 19:22:06,512 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-09 19:22:06,512 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 254 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:06,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 457 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2024-11-09 19:22:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3388. [2024-11-09 19:22:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.834661942722173) internal successors, (6214), 3387 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 6214 transitions. [2024-11-09 19:22:06,549 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 6214 transitions. Word has length 240 [2024-11-09 19:22:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:06,550 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 6214 transitions. [2024-11-09 19:22:06,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 6214 transitions. [2024-11-09 19:22:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 19:22:06,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:06,553 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 19:22:06,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:22:06,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -825069419, now seen corresponding path program 1 times [2024-11-09 19:22:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:06,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628091831] [2024-11-09 19:22:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:06,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:06,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628091831] [2024-11-09 19:22:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628091831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:06,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:22:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605572891] [2024-11-09 19:22:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:06,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:06,896 INFO L87 Difference]: Start difference. First operand 3388 states and 6214 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:08,337 INFO L93 Difference]: Finished difference Result 10122 states and 18774 transitions. [2024-11-09 19:22:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-11-09 19:22:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:08,353 INFO L225 Difference]: With dead ends: 10122 [2024-11-09 19:22:08,353 INFO L226 Difference]: Without dead ends: 6736 [2024-11-09 19:22:08,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:08,358 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 560 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:08,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 126 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:22:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2024-11-09 19:22:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6170. [2024-11-09 19:22:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6170 states, 6169 states have (on average 1.8456800129680662) internal successors, (11386), 6169 states have internal predecessors, (11386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 11386 transitions. [2024-11-09 19:22:08,438 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 11386 transitions. Word has length 241 [2024-11-09 19:22:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:08,439 INFO L471 AbstractCegarLoop]: Abstraction has 6170 states and 11386 transitions. [2024-11-09 19:22:08,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 11386 transitions. [2024-11-09 19:22:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 19:22:08,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:08,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:22:08,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:22:08,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:08,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash 509889944, now seen corresponding path program 1 times [2024-11-09 19:22:08,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:08,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080625310] [2024-11-09 19:22:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 19:22:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080625310] [2024-11-09 19:22:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080625310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:08,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:08,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859365212] [2024-11-09 19:22:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:08,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:08,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:08,628 INFO L87 Difference]: Start difference. First operand 6170 states and 11386 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:09,474 INFO L93 Difference]: Finished difference Result 14202 states and 26319 transitions. [2024-11-09 19:22:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 252 [2024-11-09 19:22:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:09,525 INFO L225 Difference]: With dead ends: 14202 [2024-11-09 19:22:09,525 INFO L226 Difference]: Without dead ends: 8404 [2024-11-09 19:22:09,542 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-09 19:22:09,543 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 285 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:09,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 460 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states. [2024-11-09 19:22:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 7846. [2024-11-09 19:22:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7846 states, 7845 states have (on average 1.8441045251752708) internal successors, (14467), 7845 states have internal predecessors, (14467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7846 states to 7846 states and 14467 transitions. [2024-11-09 19:22:09,778 INFO L78 Accepts]: Start accepts. Automaton has 7846 states and 14467 transitions. Word has length 252 [2024-11-09 19:22:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:09,779 INFO L471 AbstractCegarLoop]: Abstraction has 7846 states and 14467 transitions. [2024-11-09 19:22:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7846 states and 14467 transitions. [2024-11-09 19:22:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-09 19:22:09,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:09,793 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:09,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:22:09,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:09,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1683532359, now seen corresponding path program 1 times [2024-11-09 19:22:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:09,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298221652] [2024-11-09 19:22:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 19:22:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298221652] [2024-11-09 19:22:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298221652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:09,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:09,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526659387] [2024-11-09 19:22:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:09,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:09,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:09,916 INFO L87 Difference]: Start difference. First operand 7846 states and 14467 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:10,801 INFO L93 Difference]: Finished difference Result 18094 states and 33670 transitions. [2024-11-09 19:22:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 285 [2024-11-09 19:22:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:10,819 INFO L225 Difference]: With dead ends: 18094 [2024-11-09 19:22:10,819 INFO L226 Difference]: Without dead ends: 10435 [2024-11-09 19:22:10,824 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-09 19:22:10,826 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 266 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:10,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 479 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10435 states. [2024-11-09 19:22:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10435 to 9695. [2024-11-09 19:22:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9695 states, 9694 states have (on average 1.834433670311533) internal successors, (17783), 9694 states have internal predecessors, (17783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9695 states to 9695 states and 17783 transitions. [2024-11-09 19:22:10,932 INFO L78 Accepts]: Start accepts. Automaton has 9695 states and 17783 transitions. Word has length 285 [2024-11-09 19:22:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:10,933 INFO L471 AbstractCegarLoop]: Abstraction has 9695 states and 17783 transitions. [2024-11-09 19:22:10,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9695 states and 17783 transitions. [2024-11-09 19:22:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 19:22:10,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:10,940 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:10,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:22:10,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1796814039, now seen corresponding path program 1 times [2024-11-09 19:22:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900887207] [2024-11-09 19:22:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 323 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:11,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900887207] [2024-11-09 19:22:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900887207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132275138] [2024-11-09 19:22:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:11,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:11,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:11,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:22:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:11,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 19:22:11,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 19:22:12,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:22:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132275138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:12,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:22:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 19:22:12,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958816092] [2024-11-09 19:22:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:12,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:12,016 INFO L87 Difference]: Start difference. First operand 9695 states and 17783 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:12,805 INFO L93 Difference]: Finished difference Result 19759 states and 36191 transitions. [2024-11-09 19:22:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2024-11-09 19:22:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:12,825 INFO L225 Difference]: With dead ends: 19759 [2024-11-09 19:22:12,825 INFO L226 Difference]: Without dead ends: 10065 [2024-11-09 19:22:12,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:12,832 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 250 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:12,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 169 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10065 states. [2024-11-09 19:22:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10065 to 9879. [2024-11-09 19:22:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9879 states, 9878 states have (on average 1.821218870216643) internal successors, (17990), 9878 states have internal predecessors, (17990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9879 states to 9879 states and 17990 transitions. [2024-11-09 19:22:12,910 INFO L78 Accepts]: Start accepts. Automaton has 9879 states and 17990 transitions. Word has length 332 [2024-11-09 19:22:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:12,910 INFO L471 AbstractCegarLoop]: Abstraction has 9879 states and 17990 transitions. [2024-11-09 19:22:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9879 states and 17990 transitions. [2024-11-09 19:22:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-09 19:22:12,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:12,916 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:12,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:22:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 19:22:13,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 521794698, now seen corresponding path program 1 times [2024-11-09 19:22:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027195810] [2024-11-09 19:22:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:22:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027195810] [2024-11-09 19:22:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027195810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363933150] [2024-11-09 19:22:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:13,259 INFO L87 Difference]: Start difference. First operand 9879 states and 17990 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:13,720 INFO L93 Difference]: Finished difference Result 19380 states and 35346 transitions. [2024-11-09 19:22:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 342 [2024-11-09 19:22:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:13,733 INFO L225 Difference]: With dead ends: 19380 [2024-11-09 19:22:13,734 INFO L226 Difference]: Without dead ends: 9873 [2024-11-09 19:22:13,739 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-09 19:22:13,739 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 303 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:13,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 41 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:22:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9873 states. [2024-11-09 19:22:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9873 to 9872. [2024-11-09 19:22:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9872 states, 9871 states have (on average 1.8211933947928274) internal successors, (17977), 9871 states have internal predecessors, (17977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9872 states to 9872 states and 17977 transitions. [2024-11-09 19:22:13,870 INFO L78 Accepts]: Start accepts. Automaton has 9872 states and 17977 transitions. Word has length 342 [2024-11-09 19:22:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 9872 states and 17977 transitions. [2024-11-09 19:22:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 9872 states and 17977 transitions. [2024-11-09 19:22:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-09 19:22:13,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:13,880 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:13,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:22:13,880 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:13,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash -50357385, now seen corresponding path program 1 times [2024-11-09 19:22:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415928989] [2024-11-09 19:22:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 19:22:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415928989] [2024-11-09 19:22:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415928989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963708824] [2024-11-09 19:22:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:14,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:14,156 INFO L87 Difference]: Start difference. First operand 9872 states and 17977 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:15,448 INFO L93 Difference]: Finished difference Result 21048 states and 38351 transitions. [2024-11-09 19:22:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 355 [2024-11-09 19:22:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:15,458 INFO L225 Difference]: With dead ends: 21048 [2024-11-09 19:22:15,459 INFO L226 Difference]: Without dead ends: 11548 [2024-11-09 19:22:15,465 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-09 19:22:15,466 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 440 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:15,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 149 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:22:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11548 states. [2024-11-09 19:22:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11548 to 11541. [2024-11-09 19:22:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11541 states, 11540 states have (on average 1.811005199306759) internal successors, (20899), 11540 states have internal predecessors, (20899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11541 states to 11541 states and 20899 transitions. [2024-11-09 19:22:15,561 INFO L78 Accepts]: Start accepts. Automaton has 11541 states and 20899 transitions. Word has length 355 [2024-11-09 19:22:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:15,561 INFO L471 AbstractCegarLoop]: Abstraction has 11541 states and 20899 transitions. [2024-11-09 19:22:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11541 states and 20899 transitions. [2024-11-09 19:22:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-09 19:22:15,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:15,569 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:22:15,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:22:15,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:15,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1769118452, now seen corresponding path program 1 times [2024-11-09 19:22:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359552802] [2024-11-09 19:22:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 19:22:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359552802] [2024-11-09 19:22:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359552802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764653050] [2024-11-09 19:22:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:15,937 INFO L87 Difference]: Start difference. First operand 11541 states and 20899 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:16,711 INFO L93 Difference]: Finished difference Result 23085 states and 41953 transitions. [2024-11-09 19:22:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2024-11-09 19:22:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:16,722 INFO L225 Difference]: With dead ends: 23085 [2024-11-09 19:22:16,722 INFO L226 Difference]: Without dead ends: 11916 [2024-11-09 19:22:16,731 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-09 19:22:16,731 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 244 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:16,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 473 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11916 states. [2024-11-09 19:22:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11916 to 11911. [2024-11-09 19:22:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11911 states, 11910 states have (on average 1.8076406381192276) internal successors, (21529), 11910 states have internal predecessors, (21529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11911 states to 11911 states and 21529 transitions. [2024-11-09 19:22:16,823 INFO L78 Accepts]: Start accepts. Automaton has 11911 states and 21529 transitions. Word has length 360 [2024-11-09 19:22:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:16,824 INFO L471 AbstractCegarLoop]: Abstraction has 11911 states and 21529 transitions. [2024-11-09 19:22:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11911 states and 21529 transitions. [2024-11-09 19:22:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-09 19:22:16,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:16,831 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1] [2024-11-09 19:22:16,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:22:16,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1692796121, now seen corresponding path program 1 times [2024-11-09 19:22:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499511700] [2024-11-09 19:22:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 19:22:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:17,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499511700] [2024-11-09 19:22:17,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499511700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:17,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:17,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765385963] [2024-11-09 19:22:17,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:17,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:17,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:17,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:17,090 INFO L87 Difference]: Start difference. First operand 11911 states and 21529 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:17,859 INFO L93 Difference]: Finished difference Result 26425 states and 47844 transitions. [2024-11-09 19:22:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2024-11-09 19:22:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:17,873 INFO L225 Difference]: With dead ends: 26425 [2024-11-09 19:22:17,873 INFO L226 Difference]: Without dead ends: 14886 [2024-11-09 19:22:17,881 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-09 19:22:17,881 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 257 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:17,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 117 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14886 states. [2024-11-09 19:22:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14886 to 14698. [2024-11-09 19:22:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14698 states, 14697 states have (on average 1.7906375450772267) internal successors, (26317), 14697 states have internal predecessors, (26317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14698 states to 14698 states and 26317 transitions. [2024-11-09 19:22:17,998 INFO L78 Accepts]: Start accepts. Automaton has 14698 states and 26317 transitions. Word has length 372 [2024-11-09 19:22:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:17,998 INFO L471 AbstractCegarLoop]: Abstraction has 14698 states and 26317 transitions. [2024-11-09 19:22:17,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 14698 states and 26317 transitions. [2024-11-09 19:22:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-09 19:22:18,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:18,005 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:18,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:22:18,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:18,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash -583231140, now seen corresponding path program 1 times [2024-11-09 19:22:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:18,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039048872] [2024-11-09 19:22:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 251 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039048872] [2024-11-09 19:22:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039048872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82810322] [2024-11-09 19:22:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:18,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:18,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:22:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:18,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:22:18,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-09 19:22:19,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:22:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82810322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:19,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:22:19,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 19:22:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492558960] [2024-11-09 19:22:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:19,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:19,035 INFO L87 Difference]: Start difference. First operand 14698 states and 26317 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:19,815 INFO L93 Difference]: Finished difference Result 29777 states and 53334 transitions. [2024-11-09 19:22:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 376 [2024-11-09 19:22:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:19,829 INFO L225 Difference]: With dead ends: 29777 [2024-11-09 19:22:19,830 INFO L226 Difference]: Without dead ends: 15451 [2024-11-09 19:22:19,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:19,838 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 253 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:19,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 440 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2024-11-09 19:22:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 15075. [2024-11-09 19:22:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15075 states, 15074 states have (on average 1.7829375082924241) internal successors, (26876), 15074 states have internal predecessors, (26876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15075 states to 15075 states and 26876 transitions. [2024-11-09 19:22:19,956 INFO L78 Accepts]: Start accepts. Automaton has 15075 states and 26876 transitions. Word has length 376 [2024-11-09 19:22:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 15075 states and 26876 transitions. [2024-11-09 19:22:19,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 15075 states and 26876 transitions. [2024-11-09 19:22:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-09 19:22:19,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:19,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:19,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:22:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 19:22:20,165 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1544079109, now seen corresponding path program 1 times [2024-11-09 19:22:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932362476] [2024-11-09 19:22:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 19:22:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932362476] [2024-11-09 19:22:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932362476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:20,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:20,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554588065] [2024-11-09 19:22:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:20,431 INFO L87 Difference]: Start difference. First operand 15075 states and 26876 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:21,831 INFO L93 Difference]: Finished difference Result 40549 states and 72036 transitions. [2024-11-09 19:22:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:21,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 382 [2024-11-09 19:22:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:21,857 INFO L225 Difference]: With dead ends: 40549 [2024-11-09 19:22:21,857 INFO L226 Difference]: Without dead ends: 25106 [2024-11-09 19:22:21,869 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-09 19:22:21,869 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 470 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:21,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 89 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:22:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25106 states. [2024-11-09 19:22:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25106 to 21015. [2024-11-09 19:22:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21015 states, 21014 states have (on average 1.7662510707147616) internal successors, (37116), 21014 states have internal predecessors, (37116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21015 states to 21015 states and 37116 transitions. [2024-11-09 19:22:22,058 INFO L78 Accepts]: Start accepts. Automaton has 21015 states and 37116 transitions. Word has length 382 [2024-11-09 19:22:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:22,059 INFO L471 AbstractCegarLoop]: Abstraction has 21015 states and 37116 transitions. [2024-11-09 19:22:22,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21015 states and 37116 transitions. [2024-11-09 19:22:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-11-09 19:22:22,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:22,069 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:22:22,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:22:22,069 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:22,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 233635817, now seen corresponding path program 1 times [2024-11-09 19:22:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610594] [2024-11-09 19:22:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-09 19:22:22,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610594] [2024-11-09 19:22:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966980110] [2024-11-09 19:22:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:22,449 INFO L87 Difference]: Start difference. First operand 21015 states and 37116 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:23,216 INFO L93 Difference]: Finished difference Result 24348 states and 42955 transitions. [2024-11-09 19:22:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 413 [2024-11-09 19:22:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:23,240 INFO L225 Difference]: With dead ends: 24348 [2024-11-09 19:22:23,240 INFO L226 Difference]: Without dead ends: 24345 [2024-11-09 19:22:23,246 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-09 19:22:23,247 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 284 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:23,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 135 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24345 states. [2024-11-09 19:22:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24345 to 20460. [2024-11-09 19:22:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20460 states, 20459 states have (on average 1.7666552617429983) internal successors, (36144), 20459 states have internal predecessors, (36144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20460 states to 20460 states and 36144 transitions. [2024-11-09 19:22:23,427 INFO L78 Accepts]: Start accepts. Automaton has 20460 states and 36144 transitions. Word has length 413 [2024-11-09 19:22:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:23,427 INFO L471 AbstractCegarLoop]: Abstraction has 20460 states and 36144 transitions. [2024-11-09 19:22:23,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 20460 states and 36144 transitions. [2024-11-09 19:22:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-09 19:22:23,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:23,438 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:23,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:22:23,438 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:23,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 753140546, now seen corresponding path program 1 times [2024-11-09 19:22:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600903321] [2024-11-09 19:22:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 19:22:23,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600903321] [2024-11-09 19:22:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600903321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:23,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914365710] [2024-11-09 19:22:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:23,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:23,751 INFO L87 Difference]: Start difference. First operand 20460 states and 36144 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:24,673 INFO L93 Difference]: Finished difference Result 44252 states and 78149 transitions. [2024-11-09 19:22:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 424 [2024-11-09 19:22:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:24,703 INFO L225 Difference]: With dead ends: 44252 [2024-11-09 19:22:24,703 INFO L226 Difference]: Without dead ends: 24164 [2024-11-09 19:22:24,718 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-09 19:22:24,719 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:24,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 71 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24164 states. [2024-11-09 19:22:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24164 to 23223. [2024-11-09 19:22:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23223 states, 23222 states have (on average 1.7579881147188012) internal successors, (40824), 23222 states have internal predecessors, (40824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 40824 transitions. [2024-11-09 19:22:25,038 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 40824 transitions. Word has length 424 [2024-11-09 19:22:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:25,039 INFO L471 AbstractCegarLoop]: Abstraction has 23223 states and 40824 transitions. [2024-11-09 19:22:25,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 40824 transitions. [2024-11-09 19:22:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-11-09 19:22:25,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:25,051 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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-09 19:22:25,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:22:25,051 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 247741237, now seen corresponding path program 1 times [2024-11-09 19:22:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:25,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664650947] [2024-11-09 19:22:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 252 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664650947] [2024-11-09 19:22:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664650947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399421915] [2024-11-09 19:22:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:25,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:25,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:25,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:25,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:22:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:25,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:22:25,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 234 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:26,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:22:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 307 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:28,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399421915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:22:28,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:22:28,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-09 19:22:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569549431] [2024-11-09 19:22:28,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:22:28,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 19:22:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 19:22:28,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-09 19:22:28,740 INFO L87 Difference]: Start difference. First operand 23223 states and 40824 transitions. Second operand has 12 states, 12 states have (on average 103.83333333333333) internal successors, (1246), 11 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:37,071 INFO L93 Difference]: Finished difference Result 61097 states and 107250 transitions. [2024-11-09 19:22:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 19:22:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 103.83333333333333) internal successors, (1246), 11 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2024-11-09 19:22:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:37,117 INFO L225 Difference]: With dead ends: 61097 [2024-11-09 19:22:37,118 INFO L226 Difference]: Without dead ends: 38056 [2024-11-09 19:22:37,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=289, Invalid=703, Unknown=0, NotChecked=0, Total=992 [2024-11-09 19:22:37,129 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6028 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 11092 mSolverCounterSat, 1056 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6028 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 12148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1056 IncrementalHoareTripleChecker+Valid, 11092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:37,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6028 Valid, 358 Invalid, 12148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1056 Valid, 11092 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-09 19:22:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38056 states. [2024-11-09 19:22:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38056 to 29513. [2024-11-09 19:22:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29513 states, 29512 states have (on average 1.741528869612361) internal successors, (51396), 29512 states have internal predecessors, (51396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29513 states to 29513 states and 51396 transitions. [2024-11-09 19:22:37,474 INFO L78 Accepts]: Start accepts. Automaton has 29513 states and 51396 transitions. Word has length 435 [2024-11-09 19:22:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:37,474 INFO L471 AbstractCegarLoop]: Abstraction has 29513 states and 51396 transitions. [2024-11-09 19:22:37,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 103.83333333333333) internal successors, (1246), 11 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 29513 states and 51396 transitions. [2024-11-09 19:22:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-09 19:22:37,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:37,484 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:37,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:22:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:37,685 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1481091572, now seen corresponding path program 1 times [2024-11-09 19:22:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381397189] [2024-11-09 19:22:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-09 19:22:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381397189] [2024-11-09 19:22:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381397189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:38,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:38,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890720266] [2024-11-09 19:22:38,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:38,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:38,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:38,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:38,106 INFO L87 Difference]: Start difference. First operand 29513 states and 51396 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:38,859 INFO L93 Difference]: Finished difference Result 33586 states and 58384 transitions. [2024-11-09 19:22:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 471 [2024-11-09 19:22:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:38,905 INFO L225 Difference]: With dead ends: 33586 [2024-11-09 19:22:38,905 INFO L226 Difference]: Without dead ends: 33583 [2024-11-09 19:22:38,915 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-09 19:22:38,916 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 286 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:38,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 127 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33583 states. [2024-11-09 19:22:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33583 to 29143. [2024-11-09 19:22:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29143 states, 29142 states have (on average 1.7422963420492759) internal successors, (50774), 29142 states have internal predecessors, (50774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29143 states to 29143 states and 50774 transitions. [2024-11-09 19:22:39,427 INFO L78 Accepts]: Start accepts. Automaton has 29143 states and 50774 transitions. Word has length 471 [2024-11-09 19:22:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:39,428 INFO L471 AbstractCegarLoop]: Abstraction has 29143 states and 50774 transitions. [2024-11-09 19:22:39,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29143 states and 50774 transitions. [2024-11-09 19:22:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-11-09 19:22:39,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:39,444 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:22:39,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:39,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 879760746, now seen corresponding path program 1 times [2024-11-09 19:22:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260888793] [2024-11-09 19:22:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 471 proven. 224 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 19:22:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260888793] [2024-11-09 19:22:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260888793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:40,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075720926] [2024-11-09 19:22:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:40,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:40,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:22:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:40,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 19:22:40,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 471 proven. 224 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 19:22:41,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:22:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 471 proven. 224 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 19:22:42,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075720926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:22:42,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:22:42,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-09 19:22:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762372457] [2024-11-09 19:22:42,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:22:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 19:22:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:42,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 19:22:42,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 19:22:42,816 INFO L87 Difference]: Start difference. First operand 29143 states and 50774 transitions. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:47,093 INFO L93 Difference]: Finished difference Result 62038 states and 107934 transitions. [2024-11-09 19:22:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 19:22:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 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 511 [2024-11-09 19:22:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:47,129 INFO L225 Difference]: With dead ends: 62038 [2024-11-09 19:22:47,129 INFO L226 Difference]: Without dead ends: 33267 [2024-11-09 19:22:47,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 1018 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2024-11-09 19:22:47,153 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 6240 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5565 mSolverCounterSat, 1136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6240 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 5565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:47,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6240 Valid, 130 Invalid, 6701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 5565 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:22:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33267 states. [2024-11-09 19:22:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33267 to 19481. [2024-11-09 19:22:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19481 states, 19480 states have (on average 1.7352156057494867) internal successors, (33802), 19480 states have internal predecessors, (33802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19481 states to 19481 states and 33802 transitions. [2024-11-09 19:22:47,389 INFO L78 Accepts]: Start accepts. Automaton has 19481 states and 33802 transitions. Word has length 511 [2024-11-09 19:22:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:47,389 INFO L471 AbstractCegarLoop]: Abstraction has 19481 states and 33802 transitions. [2024-11-09 19:22:47,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 19481 states and 33802 transitions. [2024-11-09 19:22:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-09 19:22:47,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:47,398 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:47,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 19:22:47,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:47,599 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:47,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1286590492, now seen corresponding path program 1 times [2024-11-09 19:22:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12306146] [2024-11-09 19:22:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 416 proven. 209 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 19:22:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:48,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12306146] [2024-11-09 19:22:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12306146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157228210] [2024-11-09 19:22:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:48,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:48,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 19:22:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:48,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:22:48,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 361 proven. 264 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 19:22:49,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:22:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 555 proven. 70 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 19:22:50,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157228210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:22:50,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:22:50,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 19:22:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024537751] [2024-11-09 19:22:50,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:22:50,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 19:22:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 19:22:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:22:50,294 INFO L87 Difference]: Start difference. First operand 19481 states and 33802 transitions. Second operand has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:53,994 INFO L93 Difference]: Finished difference Result 47496 states and 82498 transitions. [2024-11-09 19:22:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 19:22:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 547 [2024-11-09 19:22:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:54,042 INFO L225 Difference]: With dead ends: 47496 [2024-11-09 19:22:54,042 INFO L226 Difference]: Without dead ends: 28387 [2024-11-09 19:22:54,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1088 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:22:54,057 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1995 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6086 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 6538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 6086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:54,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 170 Invalid, 6538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 6086 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:22:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28387 states. [2024-11-09 19:22:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28387 to 22260. [2024-11-09 19:22:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22260 states, 22259 states have (on average 1.73624152028393) internal successors, (38647), 22259 states have internal predecessors, (38647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22260 states to 22260 states and 38647 transitions. [2024-11-09 19:22:54,324 INFO L78 Accepts]: Start accepts. Automaton has 22260 states and 38647 transitions. Word has length 547 [2024-11-09 19:22:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:54,324 INFO L471 AbstractCegarLoop]: Abstraction has 22260 states and 38647 transitions. [2024-11-09 19:22:54,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 22260 states and 38647 transitions. [2024-11-09 19:22:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2024-11-09 19:22:54,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:54,346 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:54,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 19:22:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 19:22:54,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:54,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1130916371, now seen corresponding path program 1 times [2024-11-09 19:22:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659468604] [2024-11-09 19:22:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 716 proven. 64 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 19:22:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659468604] [2024-11-09 19:22:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659468604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854587563] [2024-11-09 19:22:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:55,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:55,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:55,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:55,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 19:22:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:55,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:22:55,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-09 19:22:55,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:22:55,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854587563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:55,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:22:55,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:22:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737490919] [2024-11-09 19:22:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:55,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:55,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:55,958 INFO L87 Difference]: Start difference. First operand 22260 states and 38647 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:56,710 INFO L93 Difference]: Finished difference Result 43035 states and 74777 transitions. [2024-11-09 19:22:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:56,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 575 [2024-11-09 19:22:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:56,711 INFO L225 Difference]: With dead ends: 43035 [2024-11-09 19:22:56,712 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:22:56,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:56,727 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 206 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:56,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 402 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:22:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:22:56,728 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-09 19:22:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:22:56,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 575 [2024-11-09 19:22:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:56,729 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:22:56,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:22:56,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:22:56,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:22:56,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 19:22:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:56,938 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:56,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:23:04,011 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 728 DAG size of output: 703 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 19:23:07,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:23:07,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:23:07 BoogieIcfgContainer [2024-11-09 19:23:07,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:23:07,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:23:07,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:23:07,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:23:07,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:58" (3/4) ... [2024-11-09 19:23:07,548 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:23:07,589 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:23:07,590 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:23:07,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:23:07,595 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:23:07,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:23:07,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:23:07,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:23:07,863 INFO L158 Benchmark]: Toolchain (without parser) took 71524.79ms. Allocated memory was 222.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 180.1MB in the beginning and 859.1MB in the end (delta: -679.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-09 19:23:07,863 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 113.2MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:23:07,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.67ms. Allocated memory is still 222.3MB. Free memory was 179.3MB in the beginning and 132.3MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 19:23:07,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.00ms. Allocated memory is still 222.3MB. Free memory was 132.3MB in the beginning and 115.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:23:07,863 INFO L158 Benchmark]: Boogie Preprocessor took 217.99ms. Allocated memory is still 222.3MB. Free memory was 115.0MB in the beginning and 171.1MB in the end (delta: -56.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-09 19:23:07,863 INFO L158 Benchmark]: IcfgBuilder took 1700.83ms. Allocated memory was 222.3MB in the beginning and 381.7MB in the end (delta: 159.4MB). Free memory was 171.1MB in the beginning and 226.4MB in the end (delta: -55.3MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2024-11-09 19:23:07,863 INFO L158 Benchmark]: TraceAbstraction took 68632.96ms. Allocated memory was 381.7MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 225.4MB in the beginning and 879.0MB in the end (delta: -653.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-09 19:23:07,864 INFO L158 Benchmark]: Witness Printer took 316.19ms. Allocated memory is still 2.2GB. Free memory was 879.0MB in the beginning and 859.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:23:07,867 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.08ms. Allocated memory is still 113.2MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.67ms. Allocated memory is still 222.3MB. Free memory was 179.3MB in the beginning and 132.3MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.00ms. Allocated memory is still 222.3MB. Free memory was 132.3MB in the beginning and 115.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 217.99ms. Allocated memory is still 222.3MB. Free memory was 115.0MB in the beginning and 171.1MB in the end (delta: -56.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1700.83ms. Allocated memory was 222.3MB in the beginning and 381.7MB in the end (delta: 159.4MB). Free memory was 171.1MB in the beginning and 226.4MB in the end (delta: -55.3MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * TraceAbstraction took 68632.96ms. Allocated memory was 381.7MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 225.4MB in the beginning and 879.0MB in the end (delta: -653.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 316.19ms. Allocated memory is still 2.2GB. Free memory was 879.0MB in the beginning and 859.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 184]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.0s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20787 SdHoareTripleChecker+Valid, 31.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20787 mSDsluCounter, 5198 SdHoareTripleChecker+Invalid, 26.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 994 mSDsCounter, 4806 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41010 IncrementalHoareTripleChecker+Invalid, 45816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4806 mSolverCounterUnsat, 4204 mSDtfsCounter, 41010 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4377 GetRequests, 4277 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29513occurred in iteration=19, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 45396 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 10328 NumberOfCodeBlocks, 10328 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 11789 ConstructedInterpolants, 0 QuantifiedInterpolants, 50718 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3655 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 11799/13864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:23:07,897 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