./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:53:33,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:53:33,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:53:33,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:53:33,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:53:33,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:53:33,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:53:33,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:53:33,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:53:33,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:53:33,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:53:33,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:53:33,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:53:33,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:53:33,554 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:53:33,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:53:33,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:53:33,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:53:33,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:53:33,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:53:33,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:53:33,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:53:33,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:53:33,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:53:33,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:53:33,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:53:33,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:53:33,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:53:33,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:53:33,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:53:33,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:53:33,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:53:33,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:53:33,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:53:33,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:53:33,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:53:33,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:53:33,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:53:33,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:53:33,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:53:33,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:53:33,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:53:33,564 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-09 19:53:33,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:53:33,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:53:33,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:53:33,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:53:33,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:53:33,780 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-09 19:53:35,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:53:35,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:53:35,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-11-09 19:53:35,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e7c6892/02f3be372a874348ad46f4105e055ea7/FLAG4aec8b938 [2024-11-09 19:53:35,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e7c6892/02f3be372a874348ad46f4105e055ea7 [2024-11-09 19:53:35,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:53:35,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:53:35,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:53:35,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:53:35,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:53:35,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:53:35" (1/1) ... [2024-11-09 19:53:35,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545296da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:35, skipping insertion in model container [2024-11-09 19:53:35,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:53:35" (1/1) ... [2024-11-09 19:53:35,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:53:35,977 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-09 19:53:36,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:53:36,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:53:36,323 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-09 19:53:36,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:53:36,569 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:53:36,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36 WrapperNode [2024-11-09 19:53:36,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:53:36,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:53:36,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:53:36,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:53:36,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:36,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:36,844 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2612 [2024-11-09 19:53:36,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:53:36,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:53:36,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:53:36,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:53:36,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:36,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:36,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,045 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:53:37,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:53:37,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:53:37,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:53:37,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:53:37,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (1/1) ... [2024-11-09 19:53:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:53:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:53:37,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:53:37,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:53:37,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:53:37,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:53:37,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:53:37,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:53:37,340 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:53:37,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:53:40,030 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2024-11-09 19:53:40,163 INFO L? ?]: Removed 949 outVars from TransFormulas that were not future-live. [2024-11-09 19:53:40,163 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:53:40,185 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:53:40,186 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:53:40,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:53:40 BoogieIcfgContainer [2024-11-09 19:53:40,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:53:40,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:53:40,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:53:40,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:53:40,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:53:35" (1/3) ... [2024-11-09 19:53:40,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad83f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:53:40, skipping insertion in model container [2024-11-09 19:53:40,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:53:36" (2/3) ... [2024-11-09 19:53:40,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad83f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:53:40, skipping insertion in model container [2024-11-09 19:53:40,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:53:40" (3/3) ... [2024-11-09 19:53:40,192 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2024-11-09 19:53:40,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:53:40,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:53:40,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:53:40,260 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;@32e88d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:53:40,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:53:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 591 states have (on average 2.4077834179357023) internal successors, (1423), 592 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 19:53:40,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:40,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:53:40,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:40,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash 856807233, now seen corresponding path program 1 times [2024-11-09 19:53:40,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:40,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075017018] [2024-11-09 19:53:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:53:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075017018] [2024-11-09 19:53:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075017018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:53:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701101120] [2024-11-09 19:53:41,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:41,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:41,087 INFO L87 Difference]: Start difference. First operand has 593 states, 591 states have (on average 2.4077834179357023) internal successors, (1423), 592 states have internal predecessors, (1423), 0 states have call successors, (0), 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.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:43,775 INFO L93 Difference]: Finished difference Result 1650 states and 4109 transitions. [2024-11-09 19:53:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-09 19:53:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:43,797 INFO L225 Difference]: With dead ends: 1650 [2024-11-09 19:53:43,801 INFO L226 Difference]: Without dead ends: 980 [2024-11-09 19:53:43,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:43,811 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 783 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:43,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 506 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 19:53:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-09 19:53:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 974. [2024-11-09 19:53:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 2.287769784172662) internal successors, (2226), 973 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2226 transitions. [2024-11-09 19:53:43,953 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2226 transitions. Word has length 65 [2024-11-09 19:53:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 2226 transitions. [2024-11-09 19:53:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2226 transitions. [2024-11-09 19:53:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 19:53:43,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:43,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:53:43,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:53:43,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:43,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash -740499135, now seen corresponding path program 1 times [2024-11-09 19:53:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:43,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175285429] [2024-11-09 19:53:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:53:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175285429] [2024-11-09 19:53:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175285429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:53:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323257856] [2024-11-09 19:53:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:44,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:44,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:44,193 INFO L87 Difference]: Start difference. First operand 974 states and 2226 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:46,739 INFO L93 Difference]: Finished difference Result 2821 states and 6537 transitions. [2024-11-09 19:53:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-11-09 19:53:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:46,747 INFO L225 Difference]: With dead ends: 2821 [2024-11-09 19:53:46,747 INFO L226 Difference]: Without dead ends: 1849 [2024-11-09 19:53:46,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:46,749 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 763 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:46,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 584 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 19:53:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2024-11-09 19:53:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1846. [2024-11-09 19:53:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 2.12520325203252) internal successors, (3921), 1845 states have internal predecessors, (3921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 3921 transitions. [2024-11-09 19:53:46,792 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 3921 transitions. Word has length 133 [2024-11-09 19:53:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:46,795 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 3921 transitions. [2024-11-09 19:53:46,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 3921 transitions. [2024-11-09 19:53:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 19:53:46,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:46,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:53:46,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:53:46,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -794835286, now seen corresponding path program 1 times [2024-11-09 19:53:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235311683] [2024-11-09 19:53:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:53:46,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235311683] [2024-11-09 19:53:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235311683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:53:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397720259] [2024-11-09 19:53:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:46,998 INFO L87 Difference]: Start difference. First operand 1846 states and 3921 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:49,394 INFO L93 Difference]: Finished difference Result 4564 states and 9874 transitions. [2024-11-09 19:53:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:49,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-09 19:53:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:49,402 INFO L225 Difference]: With dead ends: 4564 [2024-11-09 19:53:49,403 INFO L226 Difference]: Without dead ends: 2720 [2024-11-09 19:53:49,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:49,405 INFO L432 NwaCegarLoop]: 1180 mSDtfsCounter, 802 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:49,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1250 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 19:53:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2024-11-09 19:53:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2718. [2024-11-09 19:53:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2717 states have (on average 2.090172984909827) internal successors, (5679), 2717 states have internal predecessors, (5679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 5679 transitions. [2024-11-09 19:53:49,440 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 5679 transitions. Word has length 136 [2024-11-09 19:53:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:49,440 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 5679 transitions. [2024-11-09 19:53:49,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 5679 transitions. [2024-11-09 19:53:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 19:53:49,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:49,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:53:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:53:49,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1659234864, now seen corresponding path program 1 times [2024-11-09 19:53:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348174549] [2024-11-09 19:53:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:53:49,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348174549] [2024-11-09 19:53:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348174549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:49,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:49,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:53:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870702232] [2024-11-09 19:53:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:49,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:49,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:49,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:49,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:49,672 INFO L87 Difference]: Start difference. First operand 2718 states and 5679 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:51,909 INFO L93 Difference]: Finished difference Result 8004 states and 16825 transitions. [2024-11-09 19:53:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2024-11-09 19:53:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:51,923 INFO L225 Difference]: With dead ends: 8004 [2024-11-09 19:53:51,923 INFO L226 Difference]: Without dead ends: 4432 [2024-11-09 19:53:51,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:51,928 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 745 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:51,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 592 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:53:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2024-11-09 19:53:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 3580. [2024-11-09 19:53:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 1.9773679798826487) internal successors, (7077), 3579 states have internal predecessors, (7077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 7077 transitions. [2024-11-09 19:53:51,980 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 7077 transitions. Word has length 206 [2024-11-09 19:53:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:51,980 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 7077 transitions. [2024-11-09 19:53:51,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 7077 transitions. [2024-11-09 19:53:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-09 19:53:51,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:51,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:53:51,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:53:51,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 649507129, now seen corresponding path program 1 times [2024-11-09 19:53:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728064590] [2024-11-09 19:53:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:53:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728064590] [2024-11-09 19:53:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728064590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:53:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227635625] [2024-11-09 19:53:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:52,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:52,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:52,202 INFO L87 Difference]: Start difference. First operand 3580 states and 7077 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:54,044 INFO L93 Difference]: Finished difference Result 9296 states and 18628 transitions. [2024-11-09 19:53:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2024-11-09 19:53:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:54,063 INFO L225 Difference]: With dead ends: 9296 [2024-11-09 19:53:54,063 INFO L226 Difference]: Without dead ends: 5718 [2024-11-09 19:53:54,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:54,069 INFO L432 NwaCegarLoop]: 1087 mSDtfsCounter, 854 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:54,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1147 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:53:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2024-11-09 19:53:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 5718. [2024-11-09 19:53:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.9732377120867588) internal successors, (11281), 5717 states have internal predecessors, (11281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 11281 transitions. [2024-11-09 19:53:54,150 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 11281 transitions. Word has length 219 [2024-11-09 19:53:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:54,151 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 11281 transitions. [2024-11-09 19:53:54,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 11281 transitions. [2024-11-09 19:53:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 19:53:54,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:54,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:53:54,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:53:54,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:54,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:54,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1075809121, now seen corresponding path program 1 times [2024-11-09 19:53:54,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:54,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671168985] [2024-11-09 19:53:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:53:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671168985] [2024-11-09 19:53:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671168985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:54,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:53:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372263259] [2024-11-09 19:53:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:54,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:54,269 INFO L87 Difference]: Start difference. First operand 5718 states and 11281 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:56,219 INFO L93 Difference]: Finished difference Result 14411 states and 28625 transitions. [2024-11-09 19:53:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-11-09 19:53:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:56,249 INFO L225 Difference]: With dead ends: 14411 [2024-11-09 19:53:56,249 INFO L226 Difference]: Without dead ends: 8694 [2024-11-09 19:53:56,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:56,260 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 746 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:56,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 450 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:53:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8694 states. [2024-11-09 19:53:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8694 to 5691. [2024-11-09 19:53:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5691 states, 5690 states have (on average 1.9753954305799648) internal successors, (11240), 5690 states have internal predecessors, (11240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5691 states to 5691 states and 11240 transitions. [2024-11-09 19:53:56,346 INFO L78 Accepts]: Start accepts. Automaton has 5691 states and 11240 transitions. Word has length 221 [2024-11-09 19:53:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:56,347 INFO L471 AbstractCegarLoop]: Abstraction has 5691 states and 11240 transitions. [2024-11-09 19:53:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5691 states and 11240 transitions. [2024-11-09 19:53:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-09 19:53:56,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:56,350 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-09 19:53:56,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:53:56,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:56,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1776575967, now seen corresponding path program 1 times [2024-11-09 19:53:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:56,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991736330] [2024-11-09 19:53:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 19:53:56,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:56,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991736330] [2024-11-09 19:53:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991736330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:56,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:53:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688130383] [2024-11-09 19:53:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:56,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:53:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:56,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:53:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:56,517 INFO L87 Difference]: Start difference. First operand 5691 states and 11240 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:53:58,688 INFO L93 Difference]: Finished difference Result 14350 states and 28529 transitions. [2024-11-09 19:53:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:53:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2024-11-09 19:53:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:53:58,715 INFO L225 Difference]: With dead ends: 14350 [2024-11-09 19:53:58,716 INFO L226 Difference]: Without dead ends: 7809 [2024-11-09 19:53:58,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:53:58,730 INFO L432 NwaCegarLoop]: 1139 mSDtfsCounter, 741 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:53:58,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1210 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:53:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states. [2024-11-09 19:53:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 7809. [2024-11-09 19:53:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7809 states, 7808 states have (on average 1.9436475409836065) internal successors, (15176), 7808 states have internal predecessors, (15176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7809 states to 7809 states and 15176 transitions. [2024-11-09 19:53:59,001 INFO L78 Accepts]: Start accepts. Automaton has 7809 states and 15176 transitions. Word has length 300 [2024-11-09 19:53:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:59,002 INFO L471 AbstractCegarLoop]: Abstraction has 7809 states and 15176 transitions. [2024-11-09 19:53:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:53:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7809 states and 15176 transitions. [2024-11-09 19:53:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-09 19:53:59,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:59,010 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-09 19:53:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:53:59,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:59,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash -751897300, now seen corresponding path program 1 times [2024-11-09 19:53:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:59,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191695267] [2024-11-09 19:53:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:53:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191695267] [2024-11-09 19:53:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191695267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:53:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:53:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:53:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965202726] [2024-11-09 19:53:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:53:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:53:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:59,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:53:59,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:53:59,359 INFO L87 Difference]: Start difference. First operand 7809 states and 15176 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:02,803 INFO L93 Difference]: Finished difference Result 22898 states and 44686 transitions. [2024-11-09 19:54:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2024-11-09 19:54:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:02,825 INFO L225 Difference]: With dead ends: 22898 [2024-11-09 19:54:02,825 INFO L226 Difference]: Without dead ends: 15091 [2024-11-09 19:54:02,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:02,834 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1539 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 3868 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 4357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 3868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:02,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 230 Invalid, 4357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 3868 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:54:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15091 states. [2024-11-09 19:54:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15091 to 13371. [2024-11-09 19:54:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13371 states, 13370 states have (on average 1.9611069558713539) internal successors, (26220), 13370 states have internal predecessors, (26220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13371 states to 13371 states and 26220 transitions. [2024-11-09 19:54:02,993 INFO L78 Accepts]: Start accepts. Automaton has 13371 states and 26220 transitions. Word has length 340 [2024-11-09 19:54:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:02,994 INFO L471 AbstractCegarLoop]: Abstraction has 13371 states and 26220 transitions. [2024-11-09 19:54:02,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 13371 states and 26220 transitions. [2024-11-09 19:54:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-09 19:54:02,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:02,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:54:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:54:03,000 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:03,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1362330973, now seen corresponding path program 1 times [2024-11-09 19:54:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488358513] [2024-11-09 19:54:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:54:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488358513] [2024-11-09 19:54:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488358513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026102077] [2024-11-09 19:54:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:03,303 INFO L87 Difference]: Start difference. First operand 13371 states and 26220 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:05,532 INFO L93 Difference]: Finished difference Result 36165 states and 70915 transitions. [2024-11-09 19:54:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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 356 [2024-11-09 19:54:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:05,560 INFO L225 Difference]: With dead ends: 36165 [2024-11-09 19:54:05,560 INFO L226 Difference]: Without dead ends: 22796 [2024-11-09 19:54:05,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:05,574 INFO L432 NwaCegarLoop]: 1131 mSDtfsCounter, 796 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:05,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1185 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:54:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2024-11-09 19:54:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 21921. [2024-11-09 19:54:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21921 states, 21920 states have (on average 1.946213503649635) internal successors, (42661), 21920 states have internal predecessors, (42661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21921 states to 21921 states and 42661 transitions. [2024-11-09 19:54:05,820 INFO L78 Accepts]: Start accepts. Automaton has 21921 states and 42661 transitions. Word has length 356 [2024-11-09 19:54:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:05,820 INFO L471 AbstractCegarLoop]: Abstraction has 21921 states and 42661 transitions. [2024-11-09 19:54:05,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 21921 states and 42661 transitions. [2024-11-09 19:54:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-11-09 19:54:05,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:05,827 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-09 19:54:05,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:54:05,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:05,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash -691010895, now seen corresponding path program 1 times [2024-11-09 19:54:05,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55682328] [2024-11-09 19:54:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 19:54:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55682328] [2024-11-09 19:54:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55682328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:54:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819121672] [2024-11-09 19:54:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:06,102 INFO L87 Difference]: Start difference. First operand 21921 states and 42661 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:07,320 INFO L93 Difference]: Finished difference Result 43398 states and 84493 transitions. [2024-11-09 19:54:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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 366 [2024-11-09 19:54:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:07,346 INFO L225 Difference]: With dead ends: 43398 [2024-11-09 19:54:07,346 INFO L226 Difference]: Without dead ends: 21479 [2024-11-09 19:54:07,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:07,366 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1028 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:07,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 124 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:54:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21479 states. [2024-11-09 19:54:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21479 to 20618. [2024-11-09 19:54:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20618 states, 20617 states have (on average 1.9481980889557162) internal successors, (40166), 20617 states have internal predecessors, (40166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20618 states to 20618 states and 40166 transitions. [2024-11-09 19:54:07,589 INFO L78 Accepts]: Start accepts. Automaton has 20618 states and 40166 transitions. Word has length 366 [2024-11-09 19:54:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:07,589 INFO L471 AbstractCegarLoop]: Abstraction has 20618 states and 40166 transitions. [2024-11-09 19:54:07,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20618 states and 40166 transitions. [2024-11-09 19:54:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-09 19:54:07,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:07,597 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-09 19:54:07,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:54:07,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:07,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:07,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1716150923, now seen corresponding path program 1 times [2024-11-09 19:54:07,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:07,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364676863] [2024-11-09 19:54:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-09 19:54:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364676863] [2024-11-09 19:54:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364676863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:08,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648436254] [2024-11-09 19:54:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:08,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:08,075 INFO L87 Difference]: Start difference. First operand 20618 states and 40166 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:10,338 INFO L93 Difference]: Finished difference Result 48071 states and 93811 transitions. [2024-11-09 19:54:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 383 [2024-11-09 19:54:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:10,371 INFO L225 Difference]: With dead ends: 48071 [2024-11-09 19:54:10,371 INFO L226 Difference]: Without dead ends: 27455 [2024-11-09 19:54:10,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:10,387 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 802 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:10,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 260 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:54:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27455 states. [2024-11-09 19:54:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27455 to 24868. [2024-11-09 19:54:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24868 states, 24867 states have (on average 1.9592632806530743) internal successors, (48721), 24867 states have internal predecessors, (48721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24868 states to 24868 states and 48721 transitions. [2024-11-09 19:54:10,655 INFO L78 Accepts]: Start accepts. Automaton has 24868 states and 48721 transitions. Word has length 383 [2024-11-09 19:54:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:10,655 INFO L471 AbstractCegarLoop]: Abstraction has 24868 states and 48721 transitions. [2024-11-09 19:54:10,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 24868 states and 48721 transitions. [2024-11-09 19:54:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-09 19:54:10,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:10,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:54:10,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:54:10,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:10,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2089836112, now seen corresponding path program 1 times [2024-11-09 19:54:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:10,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422595802] [2024-11-09 19:54:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:10,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422595802] [2024-11-09 19:54:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422595802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:10,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:10,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414086040] [2024-11-09 19:54:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:54:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:10,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:54:10,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:10,967 INFO L87 Difference]: Start difference. First operand 24868 states and 48721 transitions. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:14,196 INFO L93 Difference]: Finished difference Result 61273 states and 119903 transitions. [2024-11-09 19:54:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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 405 [2024-11-09 19:54:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:14,237 INFO L225 Difference]: With dead ends: 61273 [2024-11-09 19:54:14,238 INFO L226 Difference]: Without dead ends: 35981 [2024-11-09 19:54:14,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:14,257 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1327 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 3771 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 3771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:14,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 194 Invalid, 4081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 3771 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:54:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35981 states. [2024-11-09 19:54:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35981 to 35980. [2024-11-09 19:54:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35980 states, 35979 states have (on average 1.9563634342255205) internal successors, (70388), 35979 states have internal predecessors, (70388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35980 states to 35980 states and 70388 transitions. [2024-11-09 19:54:14,727 INFO L78 Accepts]: Start accepts. Automaton has 35980 states and 70388 transitions. Word has length 405 [2024-11-09 19:54:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 35980 states and 70388 transitions. [2024-11-09 19:54:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35980 states and 70388 transitions. [2024-11-09 19:54:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-11-09 19:54:14,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:14,747 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-09 19:54:14,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:54:14,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:14,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1802911226, now seen corresponding path program 1 times [2024-11-09 19:54:14,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:14,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666635466] [2024-11-09 19:54:14,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 19:54:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666635466] [2024-11-09 19:54:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666635466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:15,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705145526] [2024-11-09 19:54:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:15,002 INFO L87 Difference]: Start difference. First operand 35980 states and 70388 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:17,382 INFO L93 Difference]: Finished difference Result 81358 states and 159204 transitions. [2024-11-09 19:54:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 429 [2024-11-09 19:54:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:17,434 INFO L225 Difference]: With dead ends: 81358 [2024-11-09 19:54:17,434 INFO L226 Difference]: Without dead ends: 45380 [2024-11-09 19:54:17,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:17,449 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 863 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:17,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 227 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:54:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45380 states. [2024-11-09 19:54:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45380 to 45364. [2024-11-09 19:54:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45364 states, 45363 states have (on average 1.9451755836254216) internal successors, (88239), 45363 states have internal predecessors, (88239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45364 states to 45364 states and 88239 transitions. [2024-11-09 19:54:18,268 INFO L78 Accepts]: Start accepts. Automaton has 45364 states and 88239 transitions. Word has length 429 [2024-11-09 19:54:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:18,269 INFO L471 AbstractCegarLoop]: Abstraction has 45364 states and 88239 transitions. [2024-11-09 19:54:18,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45364 states and 88239 transitions. [2024-11-09 19:54:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-11-09 19:54:18,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:18,286 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-09 19:54:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:54:18,422 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:18,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -6089151, now seen corresponding path program 1 times [2024-11-09 19:54:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929224290] [2024-11-09 19:54:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:18,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-09 19:54:18,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:18,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929224290] [2024-11-09 19:54:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929224290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:18,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:18,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142234014] [2024-11-09 19:54:18,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:18,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:18,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:18,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:18,658 INFO L87 Difference]: Start difference. First operand 45364 states and 88239 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:21,073 INFO L93 Difference]: Finished difference Result 98825 states and 193097 transitions. [2024-11-09 19:54:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 530 [2024-11-09 19:54:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:21,152 INFO L225 Difference]: With dead ends: 98825 [2024-11-09 19:54:21,153 INFO L226 Difference]: Without dead ends: 51752 [2024-11-09 19:54:21,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:21,180 INFO L432 NwaCegarLoop]: 1068 mSDtfsCounter, 769 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:21,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1126 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:54:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51752 states. [2024-11-09 19:54:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51752 to 51750. [2024-11-09 19:54:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51750 states, 51749 states have (on average 1.9400181646022145) internal successors, (100394), 51749 states have internal predecessors, (100394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51750 states to 51750 states and 100394 transitions. [2024-11-09 19:54:22,207 INFO L78 Accepts]: Start accepts. Automaton has 51750 states and 100394 transitions. Word has length 530 [2024-11-09 19:54:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 51750 states and 100394 transitions. [2024-11-09 19:54:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 51750 states and 100394 transitions. [2024-11-09 19:54:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2024-11-09 19:54:22,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:22,224 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-11-09 19:54:22,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:54:22,224 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -64922931, now seen corresponding path program 1 times [2024-11-09 19:54:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120887711] [2024-11-09 19:54:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 62 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:23,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120887711] [2024-11-09 19:54:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120887711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:54:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680467152] [2024-11-09 19:54:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:23,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:54:23,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:54:23,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:54:23,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:54:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:23,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 19:54:23,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:54:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 62 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:23,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:54:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680467152] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:54:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:54:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2024-11-09 19:54:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524271204] [2024-11-09 19:54:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:54:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:24,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:54:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:54:24,521 INFO L87 Difference]: Start difference. First operand 51750 states and 100394 transitions. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:29,566 INFO L93 Difference]: Finished difference Result 146640 states and 284419 transitions. [2024-11-09 19:54:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 19:54:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 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 552 [2024-11-09 19:54:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:29,735 INFO L225 Difference]: With dead ends: 146640 [2024-11-09 19:54:29,735 INFO L226 Difference]: Without dead ends: 91907 [2024-11-09 19:54:29,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1100 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-09 19:54:29,771 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 2070 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5313 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 5313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:29,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2070 Valid, 215 Invalid, 6060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 5313 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 19:54:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91907 states. [2024-11-09 19:54:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91907 to 75678. [2024-11-09 19:54:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75678 states, 75677 states have (on average 1.9364932542251938) internal successors, (146548), 75677 states have internal predecessors, (146548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75678 states to 75678 states and 146548 transitions. [2024-11-09 19:54:31,194 INFO L78 Accepts]: Start accepts. Automaton has 75678 states and 146548 transitions. Word has length 552 [2024-11-09 19:54:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 75678 states and 146548 transitions. [2024-11-09 19:54:31,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75678 states and 146548 transitions. [2024-11-09 19:54:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-11-09 19:54:31,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:31,216 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-09 19:54:31,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:54:31,416 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-09 19:54:31,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:31,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:31,417 INFO L85 PathProgramCache]: Analyzing trace with hash -211648654, now seen corresponding path program 1 times [2024-11-09 19:54:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064103186] [2024-11-09 19:54:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-09 19:54:31,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:31,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064103186] [2024-11-09 19:54:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064103186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:31,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843260034] [2024-11-09 19:54:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:31,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:31,904 INFO L87 Difference]: Start difference. First operand 75678 states and 146548 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:34,237 INFO L93 Difference]: Finished difference Result 144886 states and 280239 transitions. [2024-11-09 19:54:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 582 [2024-11-09 19:54:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:34,325 INFO L225 Difference]: With dead ends: 144886 [2024-11-09 19:54:34,325 INFO L226 Difference]: Without dead ends: 64518 [2024-11-09 19:54:34,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:34,348 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 779 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:34,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 996 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:54:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64518 states. [2024-11-09 19:54:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64518 to 64514. [2024-11-09 19:54:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64514 states, 64513 states have (on average 1.9189155674050191) internal successors, (123795), 64513 states have internal predecessors, (123795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64514 states to 64514 states and 123795 transitions. [2024-11-09 19:54:35,504 INFO L78 Accepts]: Start accepts. Automaton has 64514 states and 123795 transitions. Word has length 582 [2024-11-09 19:54:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:35,505 INFO L471 AbstractCegarLoop]: Abstraction has 64514 states and 123795 transitions. [2024-11-09 19:54:35,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 64514 states and 123795 transitions. [2024-11-09 19:54:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2024-11-09 19:54:35,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:35,535 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1] [2024-11-09 19:54:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:54:35,535 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2138815199, now seen corresponding path program 1 times [2024-11-09 19:54:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969516157] [2024-11-09 19:54:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-09 19:54:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969516157] [2024-11-09 19:54:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969516157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:36,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:36,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515271286] [2024-11-09 19:54:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:36,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:36,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:36,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:36,015 INFO L87 Difference]: Start difference. First operand 64514 states and 123795 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:38,402 INFO L93 Difference]: Finished difference Result 134558 states and 258239 transitions. [2024-11-09 19:54:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:38,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 804 [2024-11-09 19:54:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:38,487 INFO L225 Difference]: With dead ends: 134558 [2024-11-09 19:54:38,488 INFO L226 Difference]: Without dead ends: 67489 [2024-11-09 19:54:38,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:38,525 INFO L432 NwaCegarLoop]: 1038 mSDtfsCounter, 803 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:38,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1079 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:54:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67489 states. [2024-11-09 19:54:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67489 to 63652. [2024-11-09 19:54:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63652 states, 63651 states have (on average 1.9092551570281693) internal successors, (121526), 63651 states have internal predecessors, (121526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63652 states to 63652 states and 121526 transitions. [2024-11-09 19:54:39,897 INFO L78 Accepts]: Start accepts. Automaton has 63652 states and 121526 transitions. Word has length 804 [2024-11-09 19:54:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 63652 states and 121526 transitions. [2024-11-09 19:54:39,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 63652 states and 121526 transitions. [2024-11-09 19:54:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2024-11-09 19:54:39,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:39,932 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1] [2024-11-09 19:54:39,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:54:39,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1684517695, now seen corresponding path program 1 times [2024-11-09 19:54:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999832589] [2024-11-09 19:54:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 1167 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 19:54:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999832589] [2024-11-09 19:54:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999832589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:54:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647985041] [2024-11-09 19:54:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:40,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:54:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:54:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:40,996 INFO L87 Difference]: Start difference. First operand 63652 states and 121526 transitions. Second operand has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:44,329 INFO L93 Difference]: Finished difference Result 131572 states and 251257 transitions. [2024-11-09 19:54:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 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 946 [2024-11-09 19:54:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:44,431 INFO L225 Difference]: With dead ends: 131572 [2024-11-09 19:54:44,431 INFO L226 Difference]: Without dead ends: 67922 [2024-11-09 19:54:44,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:44,475 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1378 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 3603 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 3603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:44,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 131 Invalid, 3979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 3603 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:54:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67922 states. [2024-11-09 19:54:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67922 to 62800. [2024-11-09 19:54:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62800 states, 62799 states have (on average 1.90776923199414) internal successors, (119806), 62799 states have internal predecessors, (119806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62800 states to 62800 states and 119806 transitions. [2024-11-09 19:54:45,649 INFO L78 Accepts]: Start accepts. Automaton has 62800 states and 119806 transitions. Word has length 946 [2024-11-09 19:54:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:45,650 INFO L471 AbstractCegarLoop]: Abstraction has 62800 states and 119806 transitions. [2024-11-09 19:54:45,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 62800 states and 119806 transitions. [2024-11-09 19:54:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2024-11-09 19:54:45,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:45,685 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1] [2024-11-09 19:54:45,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:54:45,685 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:45,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 314729042, now seen corresponding path program 1 times [2024-11-09 19:54:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140515182] [2024-11-09 19:54:45,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:45,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 1045 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-11-09 19:54:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140515182] [2024-11-09 19:54:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140515182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:54:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558265611] [2024-11-09 19:54:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:54:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:54:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:46,529 INFO L87 Difference]: Start difference. First operand 62800 states and 119806 transitions. Second operand has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:49,537 INFO L93 Difference]: Finished difference Result 129416 states and 246912 transitions. [2024-11-09 19:54:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:49,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 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 962 [2024-11-09 19:54:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:50,010 INFO L225 Difference]: With dead ends: 129416 [2024-11-09 19:54:50,010 INFO L226 Difference]: Without dead ends: 66618 [2024-11-09 19:54:50,057 INFO L431 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-09 19:54:50,057 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1533 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4458 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 4723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 4458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:50,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 287 Invalid, 4723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 4458 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 19:54:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66618 states. [2024-11-09 19:54:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66618 to 64481. [2024-11-09 19:54:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64481 states, 64480 states have (on average 1.90162841191067) internal successors, (122617), 64480 states have internal predecessors, (122617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64481 states to 64481 states and 122617 transitions. [2024-11-09 19:54:51,037 INFO L78 Accepts]: Start accepts. Automaton has 64481 states and 122617 transitions. Word has length 962 [2024-11-09 19:54:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:51,038 INFO L471 AbstractCegarLoop]: Abstraction has 64481 states and 122617 transitions. [2024-11-09 19:54:51,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 64481 states and 122617 transitions. [2024-11-09 19:54:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2024-11-09 19:54:51,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:51,091 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2024-11-09 19:54:51,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:54:51,092 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:51,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash -501045648, now seen corresponding path program 1 times [2024-11-09 19:54:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18939207] [2024-11-09 19:54:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 699 proven. 63 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-09 19:54:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18939207] [2024-11-09 19:54:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18939207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:54:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376917438] [2024-11-09 19:54:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:54:52,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:54:52,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:54:52,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:54:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:52,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 19:54:52,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:54:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-09 19:54:53,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:54:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376917438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:54:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 19:54:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303740463] [2024-11-09 19:54:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:54:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:54:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:54:53,842 INFO L87 Difference]: Start difference. First operand 64481 states and 122617 transitions. Second operand has 4 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:57,346 INFO L93 Difference]: Finished difference Result 122539 states and 232984 transitions. [2024-11-09 19:54:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 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 986 [2024-11-09 19:54:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:57,349 INFO L225 Difference]: With dead ends: 122539 [2024-11-09 19:54:57,349 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:54:57,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:54:57,381 INFO L432 NwaCegarLoop]: 1032 mSDtfsCounter, 1177 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4441 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 4613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 4441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:57,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1108 Invalid, 4613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 4441 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 19:54:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:54:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:54:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:54:57,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 986 [2024-11-09 19:54:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:57,384 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:54:57,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:54:57,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:54:57,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:54:57,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:54:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-09 19:54:57,591 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:54:57,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.