./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem17_label39.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 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:18:53,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:18:54,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:18:54,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:18:54,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:18:54,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:18:54,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:18:54,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:18:54,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:18:54,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:18:54,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:18:54,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:18:54,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:18:54,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:18:54,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:18:54,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:18:54,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:18:54,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:18:54,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:18:54,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:18:54,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:18:54,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:18:54,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:18:54,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:18:54,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:18:54,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:18:54,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:18:54,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:18:54,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:18:54,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:18:54,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:18:54,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:18:54,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:18:54,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:18:54,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:18:54,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:18:54,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:18:54,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:18:54,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:18:54,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:18:54,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:18:54,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:18:54,108 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 -> 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c [2024-11-11 17:18:54,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:18:54,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:18:54,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:18:54,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:18:54,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:18:54,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-11-11 17:18:55,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:18:56,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:18:56,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-11-11 17:18:56,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c54892e/ebfca89ed1d949c5832b40b3c28cb79d/FLAG933c37ffc [2024-11-11 17:18:56,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c54892e/ebfca89ed1d949c5832b40b3c28cb79d [2024-11-11 17:18:56,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:18:56,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:18:56,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:18:56,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:18:56,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:18:56,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:18:56" (1/1) ... [2024-11-11 17:18:56,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65809d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:56, skipping insertion in model container [2024-11-11 17:18:56,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:18:56" (1/1) ... [2024-11-11 17:18:56,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:18:56,817 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/Problem17_label39.c[9366,9379] [2024-11-11 17:18:57,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:18:57,240 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:18:57,282 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/Problem17_label39.c[9366,9379] [2024-11-11 17:18:57,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:18:57,565 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:18:57,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57 WrapperNode [2024-11-11 17:18:57,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:18:57,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:18:57,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:18:57,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:18:57,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:57,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:57,950 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-11 17:18:57,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:18:57,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:18:57,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:18:57,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:18:57,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:57,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:57,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,091 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-11 17:18:58,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:18:58,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:18:58,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:18:58,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:18:58,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (1/1) ... [2024-11-11 17:18:58,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:18:58,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:18:58,394 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-11 17:18:58,402 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-11 17:18:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:18:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:18:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:18:58,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:18:58,491 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:18:58,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:19:00,906 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-11 17:19:00,907 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:19:00,935 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:19:00,939 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:19:00,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:19:00 BoogieIcfgContainer [2024-11-11 17:19:00,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:19:00,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:19:00,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:19:00,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:19:00,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:18:56" (1/3) ... [2024-11-11 17:19:00,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cd643e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:19:00, skipping insertion in model container [2024-11-11 17:19:00,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:18:57" (2/3) ... [2024-11-11 17:19:00,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cd643e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:19:00, skipping insertion in model container [2024-11-11 17:19:00,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:19:00" (3/3) ... [2024-11-11 17:19:00,947 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2024-11-11 17:19:00,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:19:00,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:19:01,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:19:01,042 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;@3444b319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:19:01,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:19:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 17:19:01,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:01,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:01,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2024-11-11 17:19:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:01,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198544336] [2024-11-11 17:19:01,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:01,394 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-11 17:19:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198544336] [2024-11-11 17:19:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198544336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:01,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:19:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069291423] [2024-11-11 17:19:01,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:01,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:01,423 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:03,483 INFO L93 Difference]: Finished difference Result 1642 states and 3024 transitions. [2024-11-11 17:19:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:03,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 17:19:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:03,500 INFO L225 Difference]: With dead ends: 1642 [2024-11-11 17:19:03,501 INFO L226 Difference]: Without dead ends: 975 [2024-11-11 17:19:03,505 INFO L434 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-11 17:19:03,507 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 427 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:03,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 17:19:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-11 17:19:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2024-11-11 17:19:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2024-11-11 17:19:03,603 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 63 [2024-11-11 17:19:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:03,608 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2024-11-11 17:19:03,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2024-11-11 17:19:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 17:19:03,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:03,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:03,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:19:03,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1757507228, now seen corresponding path program 1 times [2024-11-11 17:19:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131426391] [2024-11-11 17:19:03,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:03,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:03,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131426391] [2024-11-11 17:19:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131426391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262757491] [2024-11-11 17:19:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:03,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:03,842 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:05,729 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2024-11-11 17:19:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-11-11 17:19:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:05,735 INFO L225 Difference]: With dead ends: 2814 [2024-11-11 17:19:05,736 INFO L226 Difference]: Without dead ends: 1844 [2024-11-11 17:19:05,737 INFO L434 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-11 17:19:05,738 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 428 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:05,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 17:19:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-11 17:19:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2024-11-11 17:19:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2024-11-11 17:19:05,793 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 133 [2024-11-11 17:19:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:05,794 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2024-11-11 17:19:05,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2024-11-11 17:19:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 17:19:05,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:05,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:05,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:19:05,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:05,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash 709411297, now seen corresponding path program 1 times [2024-11-11 17:19:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:05,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310659985] [2024-11-11 17:19:05,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:06,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:06,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310659985] [2024-11-11 17:19:06,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310659985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:06,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:06,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:19:06,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800163335] [2024-11-11 17:19:06,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:06,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:06,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:06,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:06,025 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:07,836 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2024-11-11 17:19:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:07,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-11 17:19:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:07,846 INFO L225 Difference]: With dead ends: 5395 [2024-11-11 17:19:07,847 INFO L226 Difference]: Without dead ends: 2701 [2024-11-11 17:19:07,850 INFO L434 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-11 17:19:07,852 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:07,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 17:19:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2024-11-11 17:19:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2024-11-11 17:19:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2024-11-11 17:19:07,897 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 155 [2024-11-11 17:19:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:07,898 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2024-11-11 17:19:07,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2024-11-11 17:19:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-11 17:19:07,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:07,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:07,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:19:07,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1764789618, now seen corresponding path program 1 times [2024-11-11 17:19:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494657375] [2024-11-11 17:19:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494657375] [2024-11-11 17:19:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494657375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84069331] [2024-11-11 17:19:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:08,128 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:09,514 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2024-11-11 17:19:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-11 17:19:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:09,525 INFO L225 Difference]: With dead ends: 7108 [2024-11-11 17:19:09,525 INFO L226 Difference]: Without dead ends: 4409 [2024-11-11 17:19:09,528 INFO L434 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-11 17:19:09,529 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:09,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:19:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-11-11 17:19:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2024-11-11 17:19:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2024-11-11 17:19:09,583 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 215 [2024-11-11 17:19:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:09,584 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2024-11-11 17:19:09,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2024-11-11 17:19:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 17:19:09,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:09,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:09,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:19:09,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1819194189, now seen corresponding path program 1 times [2024-11-11 17:19:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:09,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959419775] [2024-11-11 17:19:09,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 17:19:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959419775] [2024-11-11 17:19:09,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959419775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804245626] [2024-11-11 17:19:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:09,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:09,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:09,725 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:11,193 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2024-11-11 17:19:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 217 [2024-11-11 17:19:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:11,210 INFO L225 Difference]: With dead ends: 10936 [2024-11-11 17:19:11,211 INFO L226 Difference]: Without dead ends: 6528 [2024-11-11 17:19:11,218 INFO L434 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-11 17:19:11,221 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 388 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:11,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:19:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2024-11-11 17:19:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2024-11-11 17:19:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2024-11-11 17:19:11,288 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 217 [2024-11-11 17:19:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:11,288 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2024-11-11 17:19:11,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2024-11-11 17:19:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-11 17:19:11,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:11,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:19:11,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:19:11,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:11,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1644382419, now seen corresponding path program 1 times [2024-11-11 17:19:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447335155] [2024-11-11 17:19:11,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-11 17:19:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447335155] [2024-11-11 17:19:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447335155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922239353] [2024-11-11 17:19:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:11,592 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:13,211 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2024-11-11 17:19:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2024-11-11 17:19:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:13,235 INFO L225 Difference]: With dead ends: 10045 [2024-11-11 17:19:13,235 INFO L226 Difference]: Without dead ends: 5665 [2024-11-11 17:19:13,245 INFO L434 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-11 17:19:13,251 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 373 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:13,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 17:19:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2024-11-11 17:19:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2024-11-11 17:19:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2024-11-11 17:19:13,384 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 283 [2024-11-11 17:19:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:13,386 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2024-11-11 17:19:13,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2024-11-11 17:19:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-11 17:19:13,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:13,389 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:13,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:19:13,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:13,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash 715443249, now seen corresponding path program 1 times [2024-11-11 17:19:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:13,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840861854] [2024-11-11 17:19:13,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-11 17:19:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840861854] [2024-11-11 17:19:13,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840861854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:13,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:13,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108529441] [2024-11-11 17:19:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:13,608 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:15,175 INFO L93 Difference]: Finished difference Result 12593 states and 14783 transitions. [2024-11-11 17:19:15,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:15,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2024-11-11 17:19:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:15,189 INFO L225 Difference]: With dead ends: 12593 [2024-11-11 17:19:15,190 INFO L226 Difference]: Without dead ends: 6936 [2024-11-11 17:19:15,193 INFO L434 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-11 17:19:15,194 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:15,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 17:19:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2024-11-11 17:19:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6936. [2024-11-11 17:19:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 6935 states have (on average 1.1322278298485942) internal successors, (7852), 6935 states have internal predecessors, (7852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 7852 transitions. [2024-11-11 17:19:15,267 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 7852 transitions. Word has length 295 [2024-11-11 17:19:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:15,268 INFO L471 AbstractCegarLoop]: Abstraction has 6936 states and 7852 transitions. [2024-11-11 17:19:15,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 7852 transitions. [2024-11-11 17:19:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-11 17:19:15,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:15,272 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:15,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:19:15,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:15,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 403479436, now seen corresponding path program 1 times [2024-11-11 17:19:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125890377] [2024-11-11 17:19:15,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:15,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125890377] [2024-11-11 17:19:15,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125890377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:15,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:15,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:19:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450316335] [2024-11-11 17:19:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:15,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:19:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:15,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:19:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:19:15,701 INFO L87 Difference]: Start difference. First operand 6936 states and 7852 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:17,979 INFO L93 Difference]: Finished difference Result 21980 states and 24837 transitions. [2024-11-11 17:19:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:19:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2024-11-11 17:19:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:18,014 INFO L225 Difference]: With dead ends: 21980 [2024-11-11 17:19:18,015 INFO L226 Difference]: Without dead ends: 15046 [2024-11-11 17:19:18,022 INFO L434 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-11 17:19:18,022 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 829 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:18,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 215 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 17:19:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15046 states. [2024-11-11 17:19:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15046 to 13337. [2024-11-11 17:19:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13337 states, 13336 states have (on average 1.1339232153569285) internal successors, (15122), 13336 states have internal predecessors, (15122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13337 states to 13337 states and 15122 transitions. [2024-11-11 17:19:18,194 INFO L78 Accepts]: Start accepts. Automaton has 13337 states and 15122 transitions. Word has length 335 [2024-11-11 17:19:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:18,195 INFO L471 AbstractCegarLoop]: Abstraction has 13337 states and 15122 transitions. [2024-11-11 17:19:18,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13337 states and 15122 transitions. [2024-11-11 17:19:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-11 17:19:18,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:18,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:18,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:19:18,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2069690024, now seen corresponding path program 1 times [2024-11-11 17:19:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583524093] [2024-11-11 17:19:18,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-11 17:19:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583524093] [2024-11-11 17:19:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583524093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955274119] [2024-11-11 17:19:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:18,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:18,453 INFO L87 Difference]: Start difference. First operand 13337 states and 15122 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-11 17:19:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:20,011 INFO L93 Difference]: Finished difference Result 35223 states and 39901 transitions. [2024-11-11 17:19:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:20,014 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 352 [2024-11-11 17:19:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:20,043 INFO L225 Difference]: With dead ends: 35223 [2024-11-11 17:19:20,043 INFO L226 Difference]: Without dead ends: 21888 [2024-11-11 17:19:20,055 INFO L434 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-11 17:19:20,057 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 438 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:20,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 820 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:19:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2024-11-11 17:19:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 21015. [2024-11-11 17:19:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21015 states, 21014 states have (on average 1.117493099838203) internal successors, (23483), 21014 states have internal predecessors, (23483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21015 states to 21015 states and 23483 transitions. [2024-11-11 17:19:20,276 INFO L78 Accepts]: Start accepts. Automaton has 21015 states and 23483 transitions. Word has length 352 [2024-11-11 17:19:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:20,277 INFO L471 AbstractCegarLoop]: Abstraction has 21015 states and 23483 transitions. [2024-11-11 17:19:20,277 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-11 17:19:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21015 states and 23483 transitions. [2024-11-11 17:19:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-11 17:19:20,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:20,284 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 17:19:20,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:19:20,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:20,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 56522163, now seen corresponding path program 1 times [2024-11-11 17:19:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985636938] [2024-11-11 17:19:20,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-11 17:19:20,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985636938] [2024-11-11 17:19:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985636938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:19:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287317192] [2024-11-11 17:19:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:20,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:20,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:20,457 INFO L87 Difference]: Start difference. First operand 21015 states and 23483 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:21,459 INFO L93 Difference]: Finished difference Result 42013 states and 46949 transitions. [2024-11-11 17:19:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 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 361 [2024-11-11 17:19:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:21,485 INFO L225 Difference]: With dead ends: 42013 [2024-11-11 17:19:21,485 INFO L226 Difference]: Without dead ends: 21000 [2024-11-11 17:19:21,502 INFO L434 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-11 17:19:21,503 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 669 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:21,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 122 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:19:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21000 states. [2024-11-11 17:19:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21000 to 20995. [2024-11-11 17:19:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20995 states, 20994 states have (on average 1.1166523768695817) internal successors, (23443), 20994 states have internal predecessors, (23443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20995 states to 20995 states and 23443 transitions. [2024-11-11 17:19:21,820 INFO L78 Accepts]: Start accepts. Automaton has 20995 states and 23443 transitions. Word has length 361 [2024-11-11 17:19:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:21,820 INFO L471 AbstractCegarLoop]: Abstraction has 20995 states and 23443 transitions. [2024-11-11 17:19:21,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20995 states and 23443 transitions. [2024-11-11 17:19:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-11 17:19:21,832 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:21,833 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 17:19:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:19:21,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash -352479738, now seen corresponding path program 1 times [2024-11-11 17:19:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938782416] [2024-11-11 17:19:21,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-11 17:19:22,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938782416] [2024-11-11 17:19:22,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938782416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:22,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:22,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:22,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574731133] [2024-11-11 17:19:22,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:22,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:22,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:22,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:22,083 INFO L87 Difference]: Start difference. First operand 20995 states and 23443 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:24,054 INFO L93 Difference]: Finished difference Result 48384 states and 54183 transitions. [2024-11-11 17:19:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:24,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 378 [2024-11-11 17:19:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:24,088 INFO L225 Difference]: With dead ends: 48384 [2024-11-11 17:19:24,089 INFO L226 Difference]: Without dead ends: 27391 [2024-11-11 17:19:24,098 INFO L434 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-11 17:19:24,099 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 444 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:24,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 255 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 17:19:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27391 states. [2024-11-11 17:19:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27391 to 25235. [2024-11-11 17:19:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25235 states, 25234 states have (on average 1.125782674169771) internal successors, (28408), 25234 states have internal predecessors, (28408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25235 states to 25235 states and 28408 transitions. [2024-11-11 17:19:24,332 INFO L78 Accepts]: Start accepts. Automaton has 25235 states and 28408 transitions. Word has length 378 [2024-11-11 17:19:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:24,333 INFO L471 AbstractCegarLoop]: Abstraction has 25235 states and 28408 transitions. [2024-11-11 17:19:24,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25235 states and 28408 transitions. [2024-11-11 17:19:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-11 17:19:24,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:24,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:19:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:19:24,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:24,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2069008964, now seen corresponding path program 1 times [2024-11-11 17:19:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692863973] [2024-11-11 17:19:24,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692863973] [2024-11-11 17:19:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692863973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:24,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:24,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594714066] [2024-11-11 17:19:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:24,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:19:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:19:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:19:24,594 INFO L87 Difference]: Start difference. First operand 25235 states and 28408 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:26,867 INFO L93 Difference]: Finished difference Result 61555 states and 69146 transitions. [2024-11-11 17:19:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:19:26,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2024-11-11 17:19:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:26,909 INFO L225 Difference]: With dead ends: 61555 [2024-11-11 17:19:26,909 INFO L226 Difference]: Without dead ends: 35897 [2024-11-11 17:19:26,927 INFO L434 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-11 17:19:26,928 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 610 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:26,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 199 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 17:19:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35897 states. [2024-11-11 17:19:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35897 to 35896. [2024-11-11 17:19:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35896 states, 35895 states have (on average 1.1228026187491293) internal successors, (40303), 35895 states have internal predecessors, (40303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 40303 transitions. [2024-11-11 17:19:27,267 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 40303 transitions. Word has length 402 [2024-11-11 17:19:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:27,267 INFO L471 AbstractCegarLoop]: Abstraction has 35896 states and 40303 transitions. [2024-11-11 17:19:27,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 40303 transitions. [2024-11-11 17:19:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-11 17:19:27,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:27,275 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:19:27,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:19:27,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 61958258, now seen corresponding path program 1 times [2024-11-11 17:19:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:27,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152932138] [2024-11-11 17:19:27,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-11 17:19:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:27,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152932138] [2024-11-11 17:19:27,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152932138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:27,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328358686] [2024-11-11 17:19:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:27,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:27,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:27,441 INFO L87 Difference]: Start difference. First operand 35896 states and 40303 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:29,216 INFO L93 Difference]: Finished difference Result 81168 states and 91136 transitions. [2024-11-11 17:19:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:29,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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-11 17:19:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:29,268 INFO L225 Difference]: With dead ends: 81168 [2024-11-11 17:19:29,268 INFO L226 Difference]: Without dead ends: 45274 [2024-11-11 17:19:29,294 INFO L434 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-11 17:19:29,295 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 503 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:29,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 224 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 17:19:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45274 states. [2024-11-11 17:19:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45274 to 45258. [2024-11-11 17:19:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45258 states, 45257 states have (on average 1.1104580506882913) internal successors, (50256), 45257 states have internal predecessors, (50256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45258 states to 45258 states and 50256 transitions. [2024-11-11 17:19:29,708 INFO L78 Accepts]: Start accepts. Automaton has 45258 states and 50256 transitions. Word has length 424 [2024-11-11 17:19:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:29,709 INFO L471 AbstractCegarLoop]: Abstraction has 45258 states and 50256 transitions. [2024-11-11 17:19:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 45258 states and 50256 transitions. [2024-11-11 17:19:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-11 17:19:29,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:29,725 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:19:29,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:29,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1067546786, now seen corresponding path program 1 times [2024-11-11 17:19:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457867344] [2024-11-11 17:19:29,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-11 17:19:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:30,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457867344] [2024-11-11 17:19:30,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457867344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:30,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:30,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:30,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116953978] [2024-11-11 17:19:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:30,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:30,200 INFO L87 Difference]: Start difference. First operand 45258 states and 50256 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:31,974 INFO L93 Difference]: Finished difference Result 99444 states and 111249 transitions. [2024-11-11 17:19:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 525 [2024-11-11 17:19:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:32,050 INFO L225 Difference]: With dead ends: 99444 [2024-11-11 17:19:32,051 INFO L226 Difference]: Without dead ends: 52481 [2024-11-11 17:19:32,086 INFO L434 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-11 17:19:32,087 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 411 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:32,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 763 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:19:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52481 states. [2024-11-11 17:19:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52481 to 52054. [2024-11-11 17:19:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52054 states, 52053 states have (on average 1.104335965266171) internal successors, (57484), 52053 states have internal predecessors, (57484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52054 states to 52054 states and 57484 transitions. [2024-11-11 17:19:32,652 INFO L78 Accepts]: Start accepts. Automaton has 52054 states and 57484 transitions. Word has length 525 [2024-11-11 17:19:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:32,653 INFO L471 AbstractCegarLoop]: Abstraction has 52054 states and 57484 transitions. [2024-11-11 17:19:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 52054 states and 57484 transitions. [2024-11-11 17:19:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-11-11 17:19:32,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:32,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:19:32,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:19:32,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:32,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 742987499, now seen corresponding path program 1 times [2024-11-11 17:19:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184485924] [2024-11-11 17:19:32,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184485924] [2024-11-11 17:19:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184485924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:19:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628381440] [2024-11-11 17:19:33,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:19:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:19:33,820 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-11 17:19:33,825 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-11 17:19:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:34,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 17:19:34,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:19:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:34,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 17:19:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:19:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628381440] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 17:19:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 17:19:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2024-11-11 17:19:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833313444] [2024-11-11 17:19:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:35,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 17:19:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 17:19:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:19:35,195 INFO L87 Difference]: Start difference. First operand 52054 states and 57484 transitions. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:38,706 INFO L93 Difference]: Finished difference Result 146297 states and 161539 transitions. [2024-11-11 17:19:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 17:19:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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 548 [2024-11-11 17:19:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:38,807 INFO L225 Difference]: With dead ends: 146297 [2024-11-11 17:19:38,807 INFO L226 Difference]: Without dead ends: 91267 [2024-11-11 17:19:38,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:19:38,844 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1127 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 1040 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:38,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 177 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 2692 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 17:19:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91267 states. [2024-11-11 17:19:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91267 to 75076. [2024-11-11 17:19:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75076 states, 75075 states have (on average 1.100979020979021) internal successors, (82656), 75075 states have internal predecessors, (82656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75076 states to 75076 states and 82656 transitions. [2024-11-11 17:19:40,224 INFO L78 Accepts]: Start accepts. Automaton has 75076 states and 82656 transitions. Word has length 548 [2024-11-11 17:19:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:40,225 INFO L471 AbstractCegarLoop]: Abstraction has 75076 states and 82656 transitions. [2024-11-11 17:19:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 75076 states and 82656 transitions. [2024-11-11 17:19:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2024-11-11 17:19:40,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:40,237 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:19:40,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 17:19:40,440 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,SelfDestructingSolverStorable14 [2024-11-11 17:19:40,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1163887151, now seen corresponding path program 1 times [2024-11-11 17:19:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347215591] [2024-11-11 17:19:40,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-11 17:19:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347215591] [2024-11-11 17:19:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347215591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:41,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675753326] [2024-11-11 17:19:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:41,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:41,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:41,078 INFO L87 Difference]: Start difference. First operand 75076 states and 82656 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:42,698 INFO L93 Difference]: Finished difference Result 144122 states and 158277 transitions. [2024-11-11 17:19:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 577 [2024-11-11 17:19:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:42,777 INFO L225 Difference]: With dead ends: 144122 [2024-11-11 17:19:42,778 INFO L226 Difference]: Without dead ends: 64367 [2024-11-11 17:19:42,949 INFO L434 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-11 17:19:42,950 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 421 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:42,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 633 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:19:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64367 states. [2024-11-11 17:19:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64367 to 64363. [2024-11-11 17:19:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64363 states, 64362 states have (on average 1.0824088748019018) internal successors, (69666), 64362 states have internal predecessors, (69666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64363 states to 64363 states and 69666 transitions. [2024-11-11 17:19:43,757 INFO L78 Accepts]: Start accepts. Automaton has 64363 states and 69666 transitions. Word has length 577 [2024-11-11 17:19:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:43,758 INFO L471 AbstractCegarLoop]: Abstraction has 64363 states and 69666 transitions. [2024-11-11 17:19:43,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 64363 states and 69666 transitions. [2024-11-11 17:19:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2024-11-11 17:19:43,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:43,791 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:19:43,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 17:19:43,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1859172721, now seen corresponding path program 1 times [2024-11-11 17:19:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495062774] [2024-11-11 17:19:43,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2024-11-11 17:19:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495062774] [2024-11-11 17:19:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495062774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:19:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837570513] [2024-11-11 17:19:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:19:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:19:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:19:44,533 INFO L87 Difference]: Start difference. First operand 64363 states and 69666 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:45,998 INFO L93 Difference]: Finished difference Result 134668 states and 145794 transitions. [2024-11-11 17:19:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:19:45,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 797 [2024-11-11 17:19:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:46,078 INFO L225 Difference]: With dead ends: 134668 [2024-11-11 17:19:46,078 INFO L226 Difference]: Without dead ends: 67756 [2024-11-11 17:19:46,120 INFO L434 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-11 17:19:46,121 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 443 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:46,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 717 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:19:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67756 states. [2024-11-11 17:19:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67756 to 63928. [2024-11-11 17:19:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63928 states, 63927 states have (on average 1.0723325042626746) internal successors, (68551), 63927 states have internal predecessors, (68551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63928 states to 63928 states and 68551 transitions. [2024-11-11 17:19:47,039 INFO L78 Accepts]: Start accepts. Automaton has 63928 states and 68551 transitions. Word has length 797 [2024-11-11 17:19:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:47,040 INFO L471 AbstractCegarLoop]: Abstraction has 63928 states and 68551 transitions. [2024-11-11 17:19:47,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63928 states and 68551 transitions. [2024-11-11 17:19:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2024-11-11 17:19:47,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:47,102 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:19:47,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 17:19:47,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1682408212, now seen corresponding path program 1 times [2024-11-11 17:19:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267623942] [2024-11-11 17:19:47,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:47,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-11 17:19:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267623942] [2024-11-11 17:19:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267623942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:19:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041765995] [2024-11-11 17:19:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:19:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:19:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:19:48,998 INFO L87 Difference]: Start difference. First operand 63928 states and 68551 transitions. Second operand has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:51,218 INFO L93 Difference]: Finished difference Result 131261 states and 140856 transitions. [2024-11-11 17:19:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:19:51,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 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 939 [2024-11-11 17:19:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:51,285 INFO L225 Difference]: With dead ends: 131261 [2024-11-11 17:19:51,285 INFO L226 Difference]: Without dead ends: 67335 [2024-11-11 17:19:51,321 INFO L434 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-11 17:19:51,322 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 653 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:51,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 130 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 17:19:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67335 states. [2024-11-11 17:19:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67335 to 63078. [2024-11-11 17:19:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63078 states, 63077 states have (on average 1.070897474515275) internal successors, (67549), 63077 states have internal predecessors, (67549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63078 states to 63078 states and 67549 transitions. [2024-11-11 17:19:52,057 INFO L78 Accepts]: Start accepts. Automaton has 63078 states and 67549 transitions. Word has length 939 [2024-11-11 17:19:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:52,058 INFO L471 AbstractCegarLoop]: Abstraction has 63078 states and 67549 transitions. [2024-11-11 17:19:52,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 63078 states and 67549 transitions. [2024-11-11 17:19:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-11-11 17:19:52,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:52,094 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:19:52,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 17:19:52,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:52,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1435722262, now seen corresponding path program 1 times [2024-11-11 17:19:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:52,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689505196] [2024-11-11 17:19:52,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-11 17:19:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689505196] [2024-11-11 17:19:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689505196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:19:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092649508] [2024-11-11 17:19:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:19:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:19:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:19:53,229 INFO L87 Difference]: Start difference. First operand 63078 states and 67549 transitions. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:55,502 INFO L93 Difference]: Finished difference Result 129538 states and 138708 transitions. [2024-11-11 17:19:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:19:55,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 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 955 [2024-11-11 17:19:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:55,584 INFO L225 Difference]: With dead ends: 129538 [2024-11-11 17:19:55,585 INFO L226 Difference]: Without dead ends: 66462 [2024-11-11 17:19:55,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:19:55,625 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 815 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:55,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 280 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 17:19:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66462 states. [2024-11-11 17:19:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66462 to 63905. [2024-11-11 17:19:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63905 states, 63904 states have (on average 1.0638301201802705) internal successors, (67983), 63904 states have internal predecessors, (67983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63905 states to 63905 states and 67983 transitions. [2024-11-11 17:19:56,586 INFO L78 Accepts]: Start accepts. Automaton has 63905 states and 67983 transitions. Word has length 955 [2024-11-11 17:19:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:56,591 INFO L471 AbstractCegarLoop]: Abstraction has 63905 states and 67983 transitions. [2024-11-11 17:19:56,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 63905 states and 67983 transitions. [2024-11-11 17:19:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2024-11-11 17:19:56,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:19:56,631 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:19:56,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 17:19:56,631 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:19:56,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:19:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1909880835, now seen corresponding path program 1 times [2024-11-11 17:19:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:19:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562757532] [2024-11-11 17:19:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:19:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:19:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:19:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-11 17:19:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:19:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562757532] [2024-11-11 17:19:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562757532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:19:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:19:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:19:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041149847] [2024-11-11 17:19:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:19:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:19:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:19:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:19:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:19:57,685 INFO L87 Difference]: Start difference. First operand 63905 states and 67983 transitions. Second operand has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:19:59,821 INFO L93 Difference]: Finished difference Result 121401 states and 129098 transitions. [2024-11-11 17:19:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:19:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 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 980 [2024-11-11 17:19:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:19:59,824 INFO L225 Difference]: With dead ends: 121401 [2024-11-11 17:19:59,825 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:19:59,866 INFO L434 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-11 17:19:59,868 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 461 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:19:59,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 710 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 17:19:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:19:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:19:59,872 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-11 17:19:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:19:59,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 980 [2024-11-11 17:19:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:19:59,873 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:19:59,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:19:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:19:59,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:19:59,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:19:59,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 17:19:59,880 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:19:59,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:20:05,593 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 403 DAG size of output: 486 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-11 17:20:07,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:20:07,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:20:07 BoogieIcfgContainer [2024-11-11 17:20:07,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:20:07,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:20:07,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:20:07,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:20:07,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:19:00" (3/4) ... [2024-11-11 17:20:07,792 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:20:07,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 17:20:07,824 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:20:07,826 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:20:07,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:20:08,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:20:08,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:20:08,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:20:08,043 INFO L158 Benchmark]: Toolchain (without parser) took 71567.87ms. Allocated memory was 167.8MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 134.6MB in the beginning and 9.5GB in the end (delta: -9.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-11 17:20:08,044 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 94.1MB in the beginning and 94.1MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:20:08,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1088.77ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 82.4MB in the end (delta: 52.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2024-11-11 17:20:08,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 383.56ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 82.4MB in the beginning and 192.0MB in the end (delta: -109.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-11-11 17:20:08,046 INFO L158 Benchmark]: Boogie Preprocessor took 407.07ms. Allocated memory is still 283.1MB. Free memory was 192.0MB in the beginning and 186.2MB in the end (delta: 5.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2024-11-11 17:20:08,046 INFO L158 Benchmark]: RCFGBuilder took 2579.91ms. Allocated memory was 283.1MB in the beginning and 499.1MB in the end (delta: 216.0MB). Free memory was 186.2MB in the beginning and 351.2MB in the end (delta: -165.0MB). Peak memory consumption was 204.1MB. Max. memory is 16.1GB. [2024-11-11 17:20:08,046 INFO L158 Benchmark]: TraceAbstraction took 66848.06ms. Allocated memory was 499.1MB in the beginning and 11.2GB in the end (delta: 10.7GB). Free memory was 351.2MB in the beginning and 9.5GB in the end (delta: -9.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-11 17:20:08,047 INFO L158 Benchmark]: Witness Printer took 253.17ms. Allocated memory is still 11.2GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 39.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-11 17:20:08,047 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.16ms. Allocated memory is still 125.8MB. Free memory was 94.1MB in the beginning and 94.1MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1088.77ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 82.4MB in the end (delta: 52.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 383.56ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 82.4MB in the beginning and 192.0MB in the end (delta: -109.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 407.07ms. Allocated memory is still 283.1MB. Free memory was 192.0MB in the beginning and 186.2MB in the end (delta: 5.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2579.91ms. Allocated memory was 283.1MB in the beginning and 499.1MB in the end (delta: 216.0MB). Free memory was 186.2MB in the beginning and 351.2MB in the end (delta: -165.0MB). Peak memory consumption was 204.1MB. Max. memory is 16.1GB. * TraceAbstraction took 66848.06ms. Allocated memory was 499.1MB in the beginning and 11.2GB in the end (delta: 10.7GB). Free memory was 351.2MB in the beginning and 9.5GB in the end (delta: -9.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 253.17ms. Allocated memory is still 11.2GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 39.9MB). Peak memory consumption was 37.7MB. 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: 207]: 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, 590 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.9s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 39.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10687 SdHoareTripleChecker+Valid, 33.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10687 mSDsluCounter, 10276 SdHoareTripleChecker+Invalid, 28.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 6343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31056 IncrementalHoareTripleChecker+Invalid, 37399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6343 mSolverCounterUnsat, 9060 mSDtfsCounter, 31056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1156 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75076occurred in iteration=15, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 34606 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 9482 NumberOfCodeBlocks, 9482 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 10008 ConstructedInterpolants, 0 QuantifiedInterpolants, 25254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 9362/9646 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: 2590]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((a21 <= 124) && (a26 <= 222)) && (((long long) a14 + 114) <= 0)) && (0 <= ((long long) a14 + 600000))) || ((((a21 <= 124) && (a26 <= 217)) && (a24 <= 1)) && (0 <= ((long long) a14 + 83)))) || ((((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (((long long) a14 + 114) <= 0)) && (218 <= a26)) && (0 <= ((long long) a14 + 600000)))) || (((a21 <= 124) && (136 <= a28)) && (a26 <= 124))) || (((((a21 <= 124) && (((long long) a14 + 182) <= 0)) && (a26 <= 600237)) && (136 <= a28)) && (0 <= ((long long) a14 + 600000)))) || (((((a21 <= 124) && (a26 <= 222)) && (a24 == 2)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((((a21 <= 124) && (a26 <= 124)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (a28 <= 134)) && (218 <= a26)) && (0 <= ((long long) a14 + 600000)))) || (((a21 <= 124) && (a28 <= 134)) && (((long long) a26 + 68) <= 0))) || ((((long long) a14 + 182) <= 0) && (a24 <= 1))) || (((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (a28 <= 134)) && (38 <= a28))) || ((((((a21 <= 124) && (a26 <= 217)) && (a24 == 2)) && (0 <= ((long long) a14 + 83))) && (125 <= a26)) && (38 <= a28))) || ((a24 <= 1) && (((long long) a26 + 68) <= 0))) || (((a21 <= 124) && (((long long) a26 + 68) <= 0)) && (0 <= ((long long) a14 + 600000)))) || ((((a21 <= 124) && (a26 <= 600237)) && (222 <= a26)) && (a24 <= 1))) || (((((a21 <= 124) && (a26 <= 600237)) && (136 <= a28)) && (a24 == 2)) && (218 <= a26))) || ((((a21 <= 124) && (244792 <= a14)) && (a26 <= 124)) && (a24 == 2))) || ((((a21 <= 124) && (a26 <= 222)) && (136 <= a28)) && (a24 == 2))) || (((((a21 <= 124) && (a24 <= 1)) && (218 <= a26)) || (((a21 <= 124) && (a24 <= 1)) && (38 <= a28))) && (((long long) a14 + 84) <= 0))) || ((((a21 <= 124) && (a26 <= 222)) && (a24 <= 1)) && (218 <= a26))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:20:08,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE