./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label14.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 ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:52:43,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:52:43,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:52:43,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:52:43,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:52:43,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:52:43,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:52:43,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:52:43,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:52:43,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:52:43,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:52:43,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:52:43,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:52:43,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:52:43,900 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:52:43,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:52:43,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:52:43,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:52:43,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:52:43,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:52:43,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:52:43,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:52:43,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:52:43,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:52:43,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:52:43,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:52:43,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:52:43,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:52:43,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:52:43,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:52:43,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:52:43,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:52:43,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:52:43,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:52:43,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:52:43,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:52:43,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:52:43,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:52:43,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:52:43,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:52:43,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:52:43,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:52:43,909 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 -> ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236 [2024-11-11 16:52:44,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:52:44,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:52:44,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:52:44,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:52:44,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:52:44,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label14.c [2024-11-11 16:52:45,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:52:46,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:52:46,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label14.c [2024-11-11 16:52:46,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509794dee/44aeb3e7dc154ffe87545fc96c5b1e79/FLAGd44964adf [2024-11-11 16:52:46,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509794dee/44aeb3e7dc154ffe87545fc96c5b1e79 [2024-11-11 16:52:46,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:52:46,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:52:46,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:52:46,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:52:46,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:52:46,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:52:46" (1/1) ... [2024-11-11 16:52:46,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7767a8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:46, skipping insertion in model container [2024-11-11 16:52:46,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:52:46" (1/1) ... [2024-11-11 16:52:46,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:52:46,456 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/Problem12_label14.c[6042,6055] [2024-11-11 16:52:47,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:52:47,210 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:52:47,239 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/Problem12_label14.c[6042,6055] [2024-11-11 16:52:47,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:52:47,630 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:52:47,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47 WrapperNode [2024-11-11 16:52:47,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:52:47,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:52:47,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:52:47,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:52:47,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:47,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:47,924 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-11 16:52:47,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:52:47,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:52:47,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:52:47,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:52:47,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:47,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:47,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:52:48,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:52:48,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:52:48,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:52:48,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:52:48,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (1/1) ... [2024-11-11 16:52:48,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:52:48,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:52:48,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:52:48,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:52:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:52:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:52:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:52:48,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:52:48,567 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:52:48,569 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:52:52,714 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-11 16:52:52,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:52:52,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:52:52,756 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:52:52,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:52:52 BoogieIcfgContainer [2024-11-11 16:52:52,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:52:52,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:52:52,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:52:52,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:52:52,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:52:46" (1/3) ... [2024-11-11 16:52:52,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3672ce62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:52:52, skipping insertion in model container [2024-11-11 16:52:52,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:52:47" (2/3) ... [2024-11-11 16:52:52,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3672ce62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:52:52, skipping insertion in model container [2024-11-11 16:52:52,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:52:52" (3/3) ... [2024-11-11 16:52:52,766 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label14.c [2024-11-11 16:52:52,783 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:52:52,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:52:52,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:52:52,867 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;@208091d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:52:52,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:52:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:52:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:52:52,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:52:52,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:52:52,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:52:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:52:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2024-11-11 16:52:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:52:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81331817] [2024-11-11 16:52:52,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:52:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:52:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:52:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:52:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:52:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81331817] [2024-11-11 16:52:53,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81331817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:52:53,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:52:53,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:52:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969924744] [2024-11-11 16:52:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:52:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:52:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:52:53,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:52:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:52:53,486 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:52:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:52:59,589 INFO L93 Difference]: Finished difference Result 3142 states and 6130 transitions. [2024-11-11 16:52:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:52:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 16:52:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:52:59,618 INFO L225 Difference]: With dead ends: 3142 [2024-11-11 16:52:59,618 INFO L226 Difference]: Without dead ends: 2257 [2024-11-11 16:52:59,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:52:59,627 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 2213 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5678 mSolverCounterSat, 1220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1220 IncrementalHoareTripleChecker+Valid, 5678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:52:59,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 783 Invalid, 6898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1220 Valid, 5678 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-11 16:52:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-11 16:52:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-11 16:52:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5802304964539007) internal successors, (3565), 2256 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:52:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3565 transitions. [2024-11-11 16:52:59,761 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3565 transitions. Word has length 48 [2024-11-11 16:52:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:52:59,762 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3565 transitions. [2024-11-11 16:52:59,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:52:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3565 transitions. [2024-11-11 16:52:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 16:52:59,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:52:59,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:52:59,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:52:59,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:52:59,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:52:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1162572255, now seen corresponding path program 1 times [2024-11-11 16:52:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:52:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479140882] [2024-11-11 16:52:59,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:52:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:52:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:53:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479140882] [2024-11-11 16:53:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479140882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487867507] [2024-11-11 16:53:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:00,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:53:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:00,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:53:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:53:00,160 INFO L87 Difference]: Start difference. First operand 2257 states and 3565 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:03,890 INFO L93 Difference]: Finished difference Result 5300 states and 9213 transitions. [2024-11-11 16:53:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:53:03,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-11 16:53:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:03,905 INFO L225 Difference]: With dead ends: 5300 [2024-11-11 16:53:03,905 INFO L226 Difference]: Without dead ends: 3759 [2024-11-11 16:53:03,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:53:03,911 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:03,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 16:53:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2024-11-11 16:53:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2024-11-11 16:53:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3685470995210218) internal successors, (5143), 3758 states have internal predecessors, (5143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5143 transitions. [2024-11-11 16:53:03,974 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5143 transitions. Word has length 119 [2024-11-11 16:53:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:03,976 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5143 transitions. [2024-11-11 16:53:03,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5143 transitions. [2024-11-11 16:53:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-11 16:53:03,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:03,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:53:03,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:03,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 560363496, now seen corresponding path program 1 times [2024-11-11 16:53:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584920820] [2024-11-11 16:53:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 16:53:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:04,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584920820] [2024-11-11 16:53:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584920820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:53:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377347734] [2024-11-11 16:53:04,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:04,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:53:04,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:53:04,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:53:04,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:53:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:04,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:53:04,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:53:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 16:53:04,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:53:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377347734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:04,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:53:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 16:53:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889976367] [2024-11-11 16:53:04,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:04,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:53:04,846 INFO L87 Difference]: Start difference. First operand 3759 states and 5143 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:07,331 INFO L93 Difference]: Finished difference Result 9769 states and 13912 transitions. [2024-11-11 16:53:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-11-11 16:53:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:07,355 INFO L225 Difference]: With dead ends: 9769 [2024-11-11 16:53:07,356 INFO L226 Difference]: Without dead ends: 6763 [2024-11-11 16:53:07,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:53:07,363 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:07,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 402 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:53:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-11 16:53:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2024-11-11 16:53:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.287341023365868) internal successors, (8705), 6762 states have internal predecessors, (8705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8705 transitions. [2024-11-11 16:53:07,518 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 8705 transitions. Word has length 193 [2024-11-11 16:53:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:07,520 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 8705 transitions. [2024-11-11 16:53:07,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 8705 transitions. [2024-11-11 16:53:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-11 16:53:07,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:07,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-11 16:53:07,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 16:53:07,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:53:07,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:07,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1542875905, now seen corresponding path program 1 times [2024-11-11 16:53:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945814969] [2024-11-11 16:53:07,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 16:53:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945814969] [2024-11-11 16:53:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945814969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394293046] [2024-11-11 16:53:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:08,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:53:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:53:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:53:08,218 INFO L87 Difference]: Start difference. First operand 6763 states and 8705 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:11,320 INFO L93 Difference]: Finished difference Result 15816 states and 21393 transitions. [2024-11-11 16:53:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:53:11,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 260 [2024-11-11 16:53:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:11,347 INFO L225 Difference]: With dead ends: 15816 [2024-11-11 16:53:11,347 INFO L226 Difference]: Without dead ends: 9769 [2024-11-11 16:53:11,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:53:11,357 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3465 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:11,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 492 Invalid, 4018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3465 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 16:53:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2024-11-11 16:53:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9767. [2024-11-11 16:53:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.272987917263977) internal successors, (12432), 9766 states have internal predecessors, (12432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12432 transitions. [2024-11-11 16:53:11,622 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12432 transitions. Word has length 260 [2024-11-11 16:53:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12432 transitions. [2024-11-11 16:53:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12432 transitions. [2024-11-11 16:53:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-11 16:53:11,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:11,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:53:11,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:53:11,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:11,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 542708520, now seen corresponding path program 1 times [2024-11-11 16:53:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:11,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891439659] [2024-11-11 16:53:11,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:53:11,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:11,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891439659] [2024-11-11 16:53:11,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891439659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:11,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163056610] [2024-11-11 16:53:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:11,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:11,871 INFO L87 Difference]: Start difference. First operand 9767 states and 12432 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:14,525 INFO L93 Difference]: Finished difference Result 23287 states and 30484 transitions. [2024-11-11 16:53:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2024-11-11 16:53:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:14,563 INFO L225 Difference]: With dead ends: 23287 [2024-11-11 16:53:14,564 INFO L226 Difference]: Without dead ends: 14273 [2024-11-11 16:53:14,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:14,574 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 709 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:14,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1394 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 16:53:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2024-11-11 16:53:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273. [2024-11-11 16:53:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.234515134529148) internal successors, (17619), 14272 states have internal predecessors, (17619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 17619 transitions. [2024-11-11 16:53:14,773 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 17619 transitions. Word has length 278 [2024-11-11 16:53:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 17619 transitions. [2024-11-11 16:53:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 17619 transitions. [2024-11-11 16:53:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-11 16:53:14,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:14,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:14,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:53:14,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:14,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash 280868765, now seen corresponding path program 1 times [2024-11-11 16:53:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:14,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040542334] [2024-11-11 16:53:14,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:14,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-11 16:53:14,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040542334] [2024-11-11 16:53:14,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040542334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:14,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:14,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:53:14,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762029050] [2024-11-11 16:53:14,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:14,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:14,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:14,995 INFO L87 Difference]: Start difference. First operand 14273 states and 17619 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:17,698 INFO L93 Difference]: Finished difference Result 39058 states and 48927 transitions. [2024-11-11 16:53:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:17,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 311 [2024-11-11 16:53:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:17,739 INFO L225 Difference]: With dead ends: 39058 [2024-11-11 16:53:17,740 INFO L226 Difference]: Without dead ends: 25538 [2024-11-11 16:53:17,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:17,759 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 620 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:17,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 597 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 16:53:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2024-11-11 16:53:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 23285. [2024-11-11 16:53:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.1806820133997595) internal successors, (27491), 23284 states have internal predecessors, (27491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 27491 transitions. [2024-11-11 16:53:18,044 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 27491 transitions. Word has length 311 [2024-11-11 16:53:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:18,045 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 27491 transitions. [2024-11-11 16:53:18,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 27491 transitions. [2024-11-11 16:53:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-11-11 16:53:18,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:18,053 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:53:18,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1741842904, now seen corresponding path program 1 times [2024-11-11 16:53:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345700303] [2024-11-11 16:53:18,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 16:53:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:19,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345700303] [2024-11-11 16:53:19,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345700303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:19,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:19,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253042342] [2024-11-11 16:53:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:19,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:19,292 INFO L87 Difference]: Start difference. First operand 23285 states and 27491 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:21,969 INFO L93 Difference]: Finished difference Result 57082 states and 68684 transitions. [2024-11-11 16:53:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 390 [2024-11-11 16:53:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:22,037 INFO L225 Difference]: With dead ends: 57082 [2024-11-11 16:53:22,037 INFO L226 Difference]: Without dead ends: 34550 [2024-11-11 16:53:22,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:22,068 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 773 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 1074 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1074 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:22,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 139 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1074 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 16:53:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34550 states. [2024-11-11 16:53:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34550 to 32297. [2024-11-11 16:53:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32297 states, 32296 states have (on average 1.2027495665097845) internal successors, (38844), 32296 states have internal predecessors, (38844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32297 states to 32297 states and 38844 transitions. [2024-11-11 16:53:22,515 INFO L78 Accepts]: Start accepts. Automaton has 32297 states and 38844 transitions. Word has length 390 [2024-11-11 16:53:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:22,516 INFO L471 AbstractCegarLoop]: Abstraction has 32297 states and 38844 transitions. [2024-11-11 16:53:22,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32297 states and 38844 transitions. [2024-11-11 16:53:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-11 16:53:22,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:22,526 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-11 16:53:22,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:53:22,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash 98614002, now seen corresponding path program 1 times [2024-11-11 16:53:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:22,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552052081] [2024-11-11 16:53:22,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:22,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 16:53:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552052081] [2024-11-11 16:53:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552052081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:22,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:22,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469553250] [2024-11-11 16:53:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:22,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:22,790 INFO L87 Difference]: Start difference. First operand 32297 states and 38844 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:25,673 INFO L93 Difference]: Finished difference Result 79612 states and 95769 transitions. [2024-11-11 16:53:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 407 [2024-11-11 16:53:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:25,737 INFO L225 Difference]: With dead ends: 79612 [2024-11-11 16:53:25,737 INFO L226 Difference]: Without dead ends: 48068 [2024-11-11 16:53:25,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:25,758 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:25,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 173 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 16:53:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2024-11-11 16:53:26,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 45064. [2024-11-11 16:53:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45064 states, 45063 states have (on average 1.1978119521558708) internal successors, (53977), 45063 states have internal predecessors, (53977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 53977 transitions. [2024-11-11 16:53:26,259 INFO L78 Accepts]: Start accepts. Automaton has 45064 states and 53977 transitions. Word has length 407 [2024-11-11 16:53:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:26,260 INFO L471 AbstractCegarLoop]: Abstraction has 45064 states and 53977 transitions. [2024-11-11 16:53:26,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45064 states and 53977 transitions. [2024-11-11 16:53:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-11 16:53:26,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:26,272 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:26,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:53:26,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1099135644, now seen corresponding path program 1 times [2024-11-11 16:53:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054023639] [2024-11-11 16:53:26,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-11 16:53:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054023639] [2024-11-11 16:53:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054023639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126831030] [2024-11-11 16:53:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:26,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:26,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:26,521 INFO L87 Difference]: Start difference. First operand 45064 states and 53977 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:28,965 INFO L93 Difference]: Finished difference Result 90877 states and 108730 transitions. [2024-11-11 16:53:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 427 [2024-11-11 16:53:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:29,010 INFO L225 Difference]: With dead ends: 90877 [2024-11-11 16:53:29,011 INFO L226 Difference]: Without dead ends: 46566 [2024-11-11 16:53:29,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:29,042 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 829 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:29,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1005 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 16:53:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46566 states. [2024-11-11 16:53:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46566 to 44313. [2024-11-11 16:53:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44313 states, 44312 states have (on average 1.158015887344286) internal successors, (51314), 44312 states have internal predecessors, (51314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44313 states to 44313 states and 51314 transitions. [2024-11-11 16:53:29,482 INFO L78 Accepts]: Start accepts. Automaton has 44313 states and 51314 transitions. Word has length 427 [2024-11-11 16:53:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:29,483 INFO L471 AbstractCegarLoop]: Abstraction has 44313 states and 51314 transitions. [2024-11-11 16:53:29,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 44313 states and 51314 transitions. [2024-11-11 16:53:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-11-11 16:53:29,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:29,491 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:53:29,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -238853480, now seen corresponding path program 1 times [2024-11-11 16:53:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289419364] [2024-11-11 16:53:29,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-11 16:53:29,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289419364] [2024-11-11 16:53:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289419364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295908870] [2024-11-11 16:53:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:29,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:29,986 INFO L87 Difference]: Start difference. First operand 44313 states and 51314 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:32,748 INFO L93 Difference]: Finished difference Result 91628 states and 105846 transitions. [2024-11-11 16:53:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 440 [2024-11-11 16:53:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:32,796 INFO L225 Difference]: With dead ends: 91628 [2024-11-11 16:53:32,797 INFO L226 Difference]: Without dead ends: 48068 [2024-11-11 16:53:32,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:32,824 INFO L435 NwaCegarLoop]: 1257 mSDtfsCounter, 649 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:32,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1265 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 16:53:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2024-11-11 16:53:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 46566. [2024-11-11 16:53:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.1437130892301084) internal successors, (53257), 46565 states have internal predecessors, (53257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 53257 transitions. [2024-11-11 16:53:33,491 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 53257 transitions. Word has length 440 [2024-11-11 16:53:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:33,492 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 53257 transitions. [2024-11-11 16:53:33,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 53257 transitions. [2024-11-11 16:53:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-11-11 16:53:33,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:33,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:33,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:53:33,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:33,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1074035742, now seen corresponding path program 1 times [2024-11-11 16:53:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437384265] [2024-11-11 16:53:33,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-11 16:53:33,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:33,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437384265] [2024-11-11 16:53:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437384265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:33,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:33,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276335275] [2024-11-11 16:53:33,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:33,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:33,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:33,961 INFO L87 Difference]: Start difference. First operand 46566 states and 53257 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:36,164 INFO L93 Difference]: Finished difference Result 102893 states and 117134 transitions. [2024-11-11 16:53:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 444 [2024-11-11 16:53:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:36,234 INFO L225 Difference]: With dead ends: 102893 [2024-11-11 16:53:36,234 INFO L226 Difference]: Without dead ends: 53325 [2024-11-11 16:53:36,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:36,257 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:36,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1323 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 16:53:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2024-11-11 16:53:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 52574. [2024-11-11 16:53:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52574 states, 52573 states have (on average 1.1233332699294314) internal successors, (59057), 52573 states have internal predecessors, (59057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52574 states to 52574 states and 59057 transitions. [2024-11-11 16:53:36,852 INFO L78 Accepts]: Start accepts. Automaton has 52574 states and 59057 transitions. Word has length 444 [2024-11-11 16:53:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:36,852 INFO L471 AbstractCegarLoop]: Abstraction has 52574 states and 59057 transitions. [2024-11-11 16:53:36,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 52574 states and 59057 transitions. [2024-11-11 16:53:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2024-11-11 16:53:36,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:36,861 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:36,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:53:36,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1113868765, now seen corresponding path program 1 times [2024-11-11 16:53:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:36,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688418123] [2024-11-11 16:53:36,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-11 16:53:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688418123] [2024-11-11 16:53:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688418123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:37,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862103022] [2024-11-11 16:53:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:37,532 INFO L87 Difference]: Start difference. First operand 52574 states and 59057 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:39,993 INFO L93 Difference]: Finished difference Result 120917 states and 136212 transitions. [2024-11-11 16:53:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2024-11-11 16:53:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:40,081 INFO L225 Difference]: With dead ends: 120917 [2024-11-11 16:53:40,081 INFO L226 Difference]: Without dead ends: 69096 [2024-11-11 16:53:40,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:40,091 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 698 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:40,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1189 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 16:53:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69096 states. [2024-11-11 16:53:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69096 to 68345. [2024-11-11 16:53:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68345 states, 68344 states have (on average 1.1071637598033477) internal successors, (75668), 68344 states have internal predecessors, (75668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68345 states to 68345 states and 75668 transitions. [2024-11-11 16:53:40,863 INFO L78 Accepts]: Start accepts. Automaton has 68345 states and 75668 transitions. Word has length 445 [2024-11-11 16:53:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:40,864 INFO L471 AbstractCegarLoop]: Abstraction has 68345 states and 75668 transitions. [2024-11-11 16:53:40,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 68345 states and 75668 transitions. [2024-11-11 16:53:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-11 16:53:40,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:40,871 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:40,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:53:40,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:40,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1553708824, now seen corresponding path program 1 times [2024-11-11 16:53:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875465346] [2024-11-11 16:53:40,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-11 16:53:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875465346] [2024-11-11 16:53:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875465346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166154802] [2024-11-11 16:53:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:41,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:41,537 INFO L87 Difference]: Start difference. First operand 68345 states and 75668 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:44,422 INFO L93 Difference]: Finished difference Result 179495 states and 199337 transitions. [2024-11-11 16:53:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2024-11-11 16:53:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:44,565 INFO L225 Difference]: With dead ends: 179495 [2024-11-11 16:53:44,565 INFO L226 Difference]: Without dead ends: 111903 [2024-11-11 16:53:44,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:44,593 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 684 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:44,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1294 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 16:53:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111903 states. [2024-11-11 16:53:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111903 to 99887. [2024-11-11 16:53:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99887 states, 99886 states have (on average 1.0905732535090003) internal successors, (108933), 99886 states have internal predecessors, (108933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99887 states to 99887 states and 108933 transitions. [2024-11-11 16:53:46,058 INFO L78 Accepts]: Start accepts. Automaton has 99887 states and 108933 transitions. Word has length 447 [2024-11-11 16:53:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:46,058 INFO L471 AbstractCegarLoop]: Abstraction has 99887 states and 108933 transitions. [2024-11-11 16:53:46,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 99887 states and 108933 transitions. [2024-11-11 16:53:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-11-11 16:53:46,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:46,067 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:46,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:53:46,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:46,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1667626267, now seen corresponding path program 1 times [2024-11-11 16:53:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470308290] [2024-11-11 16:53:46,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-11 16:53:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470308290] [2024-11-11 16:53:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470308290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:46,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766416180] [2024-11-11 16:53:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:46,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:46,499 INFO L87 Difference]: Start difference. First operand 99887 states and 108933 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:49,230 INFO L93 Difference]: Finished difference Result 200523 states and 218616 transitions. [2024-11-11 16:53:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 497 [2024-11-11 16:53:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:49,341 INFO L225 Difference]: With dead ends: 200523 [2024-11-11 16:53:49,341 INFO L226 Difference]: Without dead ends: 101389 [2024-11-11 16:53:49,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:49,383 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:49,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 219 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 16:53:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101389 states. [2024-11-11 16:53:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101389 to 94630. [2024-11-11 16:53:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94630 states, 94629 states have (on average 1.0756216381870252) internal successors, (101785), 94629 states have internal predecessors, (101785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94630 states to 94630 states and 101785 transitions. [2024-11-11 16:53:50,552 INFO L78 Accepts]: Start accepts. Automaton has 94630 states and 101785 transitions. Word has length 497 [2024-11-11 16:53:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:50,553 INFO L471 AbstractCegarLoop]: Abstraction has 94630 states and 101785 transitions. [2024-11-11 16:53:50,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 94630 states and 101785 transitions. [2024-11-11 16:53:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-11-11 16:53:50,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:50,559 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:50,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:53:50,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1238147040, now seen corresponding path program 1 times [2024-11-11 16:53:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412200581] [2024-11-11 16:53:50,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-11 16:53:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412200581] [2024-11-11 16:53:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412200581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462941358] [2024-11-11 16:53:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:51,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:51,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:51,136 INFO L87 Difference]: Start difference. First operand 94630 states and 101785 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:54,134 INFO L93 Difference]: Finished difference Result 188507 states and 202812 transitions. [2024-11-11 16:53:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:54,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 510 [2024-11-11 16:53:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:54,235 INFO L225 Difference]: With dead ends: 188507 [2024-11-11 16:53:54,235 INFO L226 Difference]: Without dead ends: 94630 [2024-11-11 16:53:54,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:54,268 INFO L435 NwaCegarLoop]: 1236 mSDtfsCounter, 567 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:54,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1244 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 16:53:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94630 states. [2024-11-11 16:53:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94630 to 90875. [2024-11-11 16:53:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90875 states, 90874 states have (on average 1.0538767964434272) internal successors, (95770), 90874 states have internal predecessors, (95770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90875 states to 90875 states and 95770 transitions. [2024-11-11 16:53:55,204 INFO L78 Accepts]: Start accepts. Automaton has 90875 states and 95770 transitions. Word has length 510 [2024-11-11 16:53:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:55,205 INFO L471 AbstractCegarLoop]: Abstraction has 90875 states and 95770 transitions. [2024-11-11 16:53:55,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 90875 states and 95770 transitions. [2024-11-11 16:53:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-11-11 16:53:55,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:55,211 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:53:55,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:53:55,212 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:55,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -931907824, now seen corresponding path program 1 times [2024-11-11 16:53:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354004559] [2024-11-11 16:53:55,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:53:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-11 16:53:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:53:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354004559] [2024-11-11 16:53:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354004559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:53:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:53:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:53:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280735847] [2024-11-11 16:53:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:53:55,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:53:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:53:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:53:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:55,750 INFO L87 Difference]: Start difference. First operand 90875 states and 95770 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:53:58,471 INFO L93 Difference]: Finished difference Result 197519 states and 208360 transitions. [2024-11-11 16:53:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:53:58,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 528 [2024-11-11 16:53:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:53:58,606 INFO L225 Difference]: With dead ends: 197519 [2024-11-11 16:53:58,606 INFO L226 Difference]: Without dead ends: 107397 [2024-11-11 16:53:58,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:53:58,653 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 826 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:53:58,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1117 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 16:53:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2024-11-11 16:53:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 102891. [2024-11-11 16:53:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102891 states, 102890 states have (on average 1.05103508601419) internal successors, (108141), 102890 states have internal predecessors, (108141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102891 states to 102891 states and 108141 transitions. [2024-11-11 16:53:59,879 INFO L78 Accepts]: Start accepts. Automaton has 102891 states and 108141 transitions. Word has length 528 [2024-11-11 16:53:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:53:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 102891 states and 108141 transitions. [2024-11-11 16:53:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:53:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 102891 states and 108141 transitions. [2024-11-11 16:53:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-11 16:53:59,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:53:59,895 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:53:59,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:53:59,895 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:53:59,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:53:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash -233960246, now seen corresponding path program 1 times [2024-11-11 16:53:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:53:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193447172] [2024-11-11 16:53:59,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:53:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:53:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:54:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-11 16:54:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:54:00,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193447172] [2024-11-11 16:54:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193447172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:54:00,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:54:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:54:00,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225392475] [2024-11-11 16:54:00,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:54:00,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:54:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:54:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:54:00,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:54:00,640 INFO L87 Difference]: Start difference. First operand 102891 states and 108141 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)