./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.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 484926faa58a404dd95f955e93679d6ad13b338cc4627616c79e80f48803476c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:38:05,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:38:05,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:38:05,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:38:05,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:38:05,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:38:05,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:38:05,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:38:05,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:38:05,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:38:05,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:38:05,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:38:05,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:38:05,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:38:05,846 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:38:05,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:38:05,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:38:05,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:38:05,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:38:05,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:38:05,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:38:05,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:38:05,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:38:05,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:38:05,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:38:05,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:38:05,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:38:05,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:38:05,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:38:05,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:38:05,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:38:05,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:38:05,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:38:05,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:38:05,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:38:05,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:38:05,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:38:05,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:38:05,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:38:05,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:38:05,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:38:05,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:38:05,859 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 -> 484926faa58a404dd95f955e93679d6ad13b338cc4627616c79e80f48803476c [2024-10-13 23:38:06,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:38:06,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:38:06,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:38:06,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:38:06,141 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:38:06,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c [2024-10-13 23:38:07,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:38:08,047 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:38:08,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c [2024-10-13 23:38:08,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9418b53df/bc61fda49b1744a9a654137f6bb8aa82/FLAG30f2b4c4a [2024-10-13 23:38:08,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9418b53df/bc61fda49b1744a9a654137f6bb8aa82 [2024-10-13 23:38:08,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:38:08,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:38:08,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:38:08,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:38:08,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:38:08,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:38:08" (1/1) ... [2024-10-13 23:38:08,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19148238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:08, skipping insertion in model container [2024-10-13 23:38:08,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:38:08" (1/1) ... [2024-10-13 23:38:08,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:38:08,571 WARN L248 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/Problem13_label28.c[2473,2486] [2024-10-13 23:38:09,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:38:09,503 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:38:09,523 WARN L248 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/Problem13_label28.c[2473,2486] [2024-10-13 23:38:10,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:38:10,068 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:38:10,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10 WrapperNode [2024-10-13 23:38:10,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:38:10,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:38:10,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:38:10,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:38:10,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:10,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:10,839 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:38:10,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:38:10,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:38:10,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:38:10,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:38:10,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:10,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,327 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-10-13 23:38:11,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:38:11,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:38:11,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:38:11,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:38:11,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (1/1) ... [2024-10-13 23:38:11,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:38:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:11,668 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-10-13 23:38:11,671 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-10-13 23:38:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:38:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:38:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:38:11,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:38:11,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:38:11,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:38:17,664 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:38:17,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:38:17,744 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:38:17,744 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:38:17,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:17 BoogieIcfgContainer [2024-10-13 23:38:17,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:38:17,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:38:17,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:38:17,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:38:17,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:38:08" (1/3) ... [2024-10-13 23:38:17,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b8c44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:17, skipping insertion in model container [2024-10-13 23:38:17,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:10" (2/3) ... [2024-10-13 23:38:17,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b8c44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:17, skipping insertion in model container [2024-10-13 23:38:17,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:17" (3/3) ... [2024-10-13 23:38:17,752 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label28.c [2024-10-13 23:38:17,771 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:38:17,771 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:38:17,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:38:17,879 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;@52eb82e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:38:17,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:38:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 23:38:17,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:17,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:17,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:17,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash 517230588, now seen corresponding path program 1 times [2024-10-13 23:38:17,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:17,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349920771] [2024-10-13 23:38:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:17,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349920771] [2024-10-13 23:38:18,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349920771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385615851] [2024-10-13 23:38:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:18,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:38:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:38:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:38:18,132 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:18,240 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-13 23:38:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:38:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-13 23:38:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:18,262 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 23:38:18,262 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 23:38:18,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:38:18,278 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:18,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:38:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 23:38:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 23:38:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-13 23:38:18,361 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 14 [2024-10-13 23:38:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:18,362 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-13 23:38:18,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-13 23:38:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 23:38:18,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:18,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:18,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:38:18,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:18,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash 557277128, now seen corresponding path program 1 times [2024-10-13 23:38:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112239300] [2024-10-13 23:38:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112239300] [2024-10-13 23:38:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112239300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:18,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054922110] [2024-10-13 23:38:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:18,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:18,508 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:22,655 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2024-10-13 23:38:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-13 23:38:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:22,664 INFO L225 Difference]: With dead ends: 2931 [2024-10-13 23:38:22,665 INFO L226 Difference]: Without dead ends: 1898 [2024-10-13 23:38:22,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:22,668 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1000 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:22,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 594 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 23:38:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-10-13 23:38:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2024-10-13 23:38:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2024-10-13 23:38:22,714 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 14 [2024-10-13 23:38:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:22,714 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2024-10-13 23:38:22,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2024-10-13 23:38:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 23:38:22,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:22,717 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:22,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:38:22,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:22,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 792848979, now seen corresponding path program 1 times [2024-10-13 23:38:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363091411] [2024-10-13 23:38:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363091411] [2024-10-13 23:38:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363091411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201980262] [2024-10-13 23:38:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:23,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:23,009 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:26,913 INFO L93 Difference]: Finished difference Result 5383 states and 9440 transitions. [2024-10-13 23:38:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:26,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-13 23:38:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:26,929 INFO L225 Difference]: With dead ends: 5383 [2024-10-13 23:38:26,930 INFO L226 Difference]: Without dead ends: 3491 [2024-10-13 23:38:26,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:26,937 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:26,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1011 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 23:38:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2024-10-13 23:38:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3490. [2024-10-13 23:38:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5385497277156779) internal successors, (5368), 3489 states have internal predecessors, (5368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5368 transitions. [2024-10-13 23:38:27,013 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5368 transitions. Word has length 79 [2024-10-13 23:38:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5368 transitions. [2024-10-13 23:38:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5368 transitions. [2024-10-13 23:38:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 23:38:27,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:27,019 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:38:27,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 126776312, now seen corresponding path program 1 times [2024-10-13 23:38:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342711575] [2024-10-13 23:38:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:27,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:27,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342711575] [2024-10-13 23:38:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342711575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:27,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641651701] [2024-10-13 23:38:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:27,164 INFO L87 Difference]: Start difference. First operand 3490 states and 5368 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:30,291 INFO L93 Difference]: Finished difference Result 10168 states and 15699 transitions. [2024-10-13 23:38:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:30,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-13 23:38:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:30,317 INFO L225 Difference]: With dead ends: 10168 [2024-10-13 23:38:30,317 INFO L226 Difference]: Without dead ends: 6679 [2024-10-13 23:38:30,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:30,328 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:30,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 845 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:38:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-13 23:38:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6668. [2024-10-13 23:38:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.3752812359382032) internal successors, (9169), 6667 states have internal predecessors, (9169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9169 transitions. [2024-10-13 23:38:30,440 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9169 transitions. Word has length 81 [2024-10-13 23:38:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:30,441 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 9169 transitions. [2024-10-13 23:38:30,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9169 transitions. [2024-10-13 23:38:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 23:38:30,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:30,446 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:30,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:38:30,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -372564474, now seen corresponding path program 1 times [2024-10-13 23:38:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540338160] [2024-10-13 23:38:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540338160] [2024-10-13 23:38:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540338160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:30,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167477063] [2024-10-13 23:38:30,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:30,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:30,668 INFO L87 Difference]: Start difference. First operand 6668 states and 9169 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:34,304 INFO L93 Difference]: Finished difference Result 19655 states and 27045 transitions. [2024-10-13 23:38:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-13 23:38:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:34,356 INFO L225 Difference]: With dead ends: 19655 [2024-10-13 23:38:34,357 INFO L226 Difference]: Without dead ends: 12988 [2024-10-13 23:38:34,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:34,373 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 852 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:34,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1149 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 23:38:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12988 states. [2024-10-13 23:38:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12988 to 12971. [2024-10-13 23:38:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 1.2367000771010024) internal successors, (16040), 12970 states have internal predecessors, (16040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 16040 transitions. [2024-10-13 23:38:34,665 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 16040 transitions. Word has length 125 [2024-10-13 23:38:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:34,666 INFO L471 AbstractCegarLoop]: Abstraction has 12971 states and 16040 transitions. [2024-10-13 23:38:34,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 16040 transitions. [2024-10-13 23:38:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 23:38:34,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:34,668 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:34,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:38:34,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:34,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -232878205, now seen corresponding path program 1 times [2024-10-13 23:38:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606258479] [2024-10-13 23:38:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606258479] [2024-10-13 23:38:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606258479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:35,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:35,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669249621] [2024-10-13 23:38:35,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:35,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:35,028 INFO L87 Difference]: Start difference. First operand 12971 states and 16040 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:37,745 INFO L93 Difference]: Finished difference Result 22791 states and 28660 transitions. [2024-10-13 23:38:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-13 23:38:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:37,770 INFO L225 Difference]: With dead ends: 22791 [2024-10-13 23:38:37,771 INFO L226 Difference]: Without dead ends: 12979 [2024-10-13 23:38:37,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:37,781 INFO L432 NwaCegarLoop]: 1026 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:37,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1210 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:38:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2024-10-13 23:38:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 12971. [2024-10-13 23:38:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 1.2351580570547418) internal successors, (16020), 12970 states have internal predecessors, (16020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 16020 transitions. [2024-10-13 23:38:37,986 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 16020 transitions. Word has length 130 [2024-10-13 23:38:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:37,987 INFO L471 AbstractCegarLoop]: Abstraction has 12971 states and 16020 transitions. [2024-10-13 23:38:37,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 16020 transitions. [2024-10-13 23:38:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 23:38:37,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:37,994 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:38:37,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 171076711, now seen corresponding path program 1 times [2024-10-13 23:38:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754313268] [2024-10-13 23:38:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:37,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754313268] [2024-10-13 23:38:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754313268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:38,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:38,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:38,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136955039] [2024-10-13 23:38:38,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:38,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:38,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:38,189 INFO L87 Difference]: Start difference. First operand 12971 states and 16020 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:41,269 INFO L93 Difference]: Finished difference Result 36165 states and 45138 transitions. [2024-10-13 23:38:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2024-10-13 23:38:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:41,304 INFO L225 Difference]: With dead ends: 36165 [2024-10-13 23:38:41,304 INFO L226 Difference]: Without dead ends: 23195 [2024-10-13 23:38:41,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:41,325 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 841 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:41,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1985 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23195 states. [2024-10-13 23:38:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23195 to 22403. [2024-10-13 23:38:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22403 states, 22402 states have (on average 1.193420230336577) internal successors, (26735), 22402 states have internal predecessors, (26735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22403 states to 22403 states and 26735 transitions. [2024-10-13 23:38:41,732 INFO L78 Accepts]: Start accepts. Automaton has 22403 states and 26735 transitions. Word has length 228 [2024-10-13 23:38:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:41,733 INFO L471 AbstractCegarLoop]: Abstraction has 22403 states and 26735 transitions. [2024-10-13 23:38:41,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22403 states and 26735 transitions. [2024-10-13 23:38:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-13 23:38:41,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:41,737 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:38:41,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1491851776, now seen corresponding path program 1 times [2024-10-13 23:38:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411798945] [2024-10-13 23:38:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-13 23:38:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411798945] [2024-10-13 23:38:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411798945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:42,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:42,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246478935] [2024-10-13 23:38:42,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:42,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:42,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:42,240 INFO L87 Difference]: Start difference. First operand 22403 states and 26735 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:45,189 INFO L93 Difference]: Finished difference Result 44018 states and 52672 transitions. [2024-10-13 23:38:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:45,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 243 [2024-10-13 23:38:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:45,223 INFO L225 Difference]: With dead ends: 44018 [2024-10-13 23:38:45,223 INFO L226 Difference]: Without dead ends: 22403 [2024-10-13 23:38:45,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:45,248 INFO L432 NwaCegarLoop]: 1065 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:45,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1194 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:38:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22403 states. [2024-10-13 23:38:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22403 to 22403. [2024-10-13 23:38:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22403 states, 22402 states have (on average 1.1931970359789303) internal successors, (26730), 22402 states have internal predecessors, (26730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22403 states to 22403 states and 26730 transitions. [2024-10-13 23:38:45,617 INFO L78 Accepts]: Start accepts. Automaton has 22403 states and 26730 transitions. Word has length 243 [2024-10-13 23:38:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 22403 states and 26730 transitions. [2024-10-13 23:38:45,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 22403 states and 26730 transitions. [2024-10-13 23:38:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 23:38:45,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:45,621 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:45,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:38:45,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1352221001, now seen corresponding path program 1 times [2024-10-13 23:38:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136420345] [2024-10-13 23:38:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 23:38:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:45,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136420345] [2024-10-13 23:38:45,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136420345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:45,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:45,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153126583] [2024-10-13 23:38:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:45,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:45,815 INFO L87 Difference]: Start difference. First operand 22403 states and 26730 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:49,199 INFO L93 Difference]: Finished difference Result 55045 states and 66947 transitions. [2024-10-13 23:38:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 250 [2024-10-13 23:38:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:49,261 INFO L225 Difference]: With dead ends: 55045 [2024-10-13 23:38:49,261 INFO L226 Difference]: Without dead ends: 33430 [2024-10-13 23:38:49,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:49,288 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 881 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:49,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 926 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33430 states. [2024-10-13 23:38:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33430 to 32634. [2024-10-13 23:38:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32634 states, 32633 states have (on average 1.1761407164526707) internal successors, (38381), 32633 states have internal predecessors, (38381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32634 states to 32634 states and 38381 transitions. [2024-10-13 23:38:49,945 INFO L78 Accepts]: Start accepts. Automaton has 32634 states and 38381 transitions. Word has length 250 [2024-10-13 23:38:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:49,946 INFO L471 AbstractCegarLoop]: Abstraction has 32634 states and 38381 transitions. [2024-10-13 23:38:49,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 32634 states and 38381 transitions. [2024-10-13 23:38:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-13 23:38:49,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:49,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:38:49,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:38:49,953 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:49,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1265900018, now seen corresponding path program 1 times [2024-10-13 23:38:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944620229] [2024-10-13 23:38:49,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:38:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944620229] [2024-10-13 23:38:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944620229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:50,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268407472] [2024-10-13 23:38:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:50,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:50,264 INFO L87 Difference]: Start difference. First operand 32634 states and 38381 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:53,774 INFO L93 Difference]: Finished difference Result 76293 states and 91192 transitions. [2024-10-13 23:38:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 305 [2024-10-13 23:38:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:53,848 INFO L225 Difference]: With dead ends: 76293 [2024-10-13 23:38:53,848 INFO L226 Difference]: Without dead ends: 44447 [2024-10-13 23:38:53,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:53,884 INFO L432 NwaCegarLoop]: 1804 mSDtfsCounter, 849 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:53,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1947 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:38:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44447 states. [2024-10-13 23:38:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44447 to 43656. [2024-10-13 23:38:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43656 states, 43655 states have (on average 1.1516664757759707) internal successors, (50276), 43655 states have internal predecessors, (50276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43656 states to 43656 states and 50276 transitions. [2024-10-13 23:38:54,481 INFO L78 Accepts]: Start accepts. Automaton has 43656 states and 50276 transitions. Word has length 305 [2024-10-13 23:38:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:54,481 INFO L471 AbstractCegarLoop]: Abstraction has 43656 states and 50276 transitions. [2024-10-13 23:38:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 43656 states and 50276 transitions. [2024-10-13 23:38:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-13 23:38:54,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:54,489 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:38:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:38:54,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:54,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2022331088, now seen corresponding path program 1 times [2024-10-13 23:38:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:54,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815700521] [2024-10-13 23:38:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:54,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 113 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 23:38:55,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:55,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815700521] [2024-10-13 23:38:55,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815700521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:38:55,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833552075] [2024-10-13 23:38:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:38:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:55,991 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-10-13 23:38:55,992 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-10-13 23:38:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:56,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:38:56,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:38:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 23:38:56,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:38:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833552075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:38:56,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-13 23:38:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077733165] [2024-10-13 23:38:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:56,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:38:56,277 INFO L87 Difference]: Start difference. First operand 43656 states and 50276 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:59,118 INFO L93 Difference]: Finished difference Result 86515 states and 99751 transitions. [2024-10-13 23:38:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:59,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 320 [2024-10-13 23:38:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:59,171 INFO L225 Difference]: With dead ends: 86515 [2024-10-13 23:38:59,171 INFO L226 Difference]: Without dead ends: 43647 [2024-10-13 23:38:59,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:38:59,206 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 1075 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:59,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 816 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:38:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43647 states. [2024-10-13 23:38:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43647 to 43646. [2024-10-13 23:38:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43646 states, 43645 states have (on average 1.1132775804788635) internal successors, (48589), 43645 states have internal predecessors, (48589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 48589 transitions. [2024-10-13 23:38:59,768 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 48589 transitions. Word has length 320 [2024-10-13 23:38:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 43646 states and 48589 transitions. [2024-10-13 23:38:59,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 48589 transitions. [2024-10-13 23:38:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-13 23:38:59,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:59,777 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:59,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:38:59,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 23:38:59,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1213421118, now seen corresponding path program 1 times [2024-10-13 23:38:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967833772] [2024-10-13 23:38:59,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-13 23:39:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967833772] [2024-10-13 23:39:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967833772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27599223] [2024-10-13 23:39:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:00,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:00,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:00,255 INFO L87 Difference]: Start difference. First operand 43646 states and 48589 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:03,575 INFO L93 Difference]: Finished difference Result 93578 states and 104977 transitions. [2024-10-13 23:39:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:03,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 339 [2024-10-13 23:39:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:03,638 INFO L225 Difference]: With dead ends: 93578 [2024-10-13 23:39:03,638 INFO L226 Difference]: Without dead ends: 50720 [2024-10-13 23:39:03,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:03,660 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 1140 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:03,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1522 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:39:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50720 states. [2024-10-13 23:39:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50720 to 50719. [2024-10-13 23:39:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50719 states, 50718 states have (on average 1.097559052013092) internal successors, (55666), 50718 states have internal predecessors, (55666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50719 states to 50719 states and 55666 transitions. [2024-10-13 23:39:04,284 INFO L78 Accepts]: Start accepts. Automaton has 50719 states and 55666 transitions. Word has length 339 [2024-10-13 23:39:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:04,284 INFO L471 AbstractCegarLoop]: Abstraction has 50719 states and 55666 transitions. [2024-10-13 23:39:04,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 50719 states and 55666 transitions. [2024-10-13 23:39:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-13 23:39:04,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:04,292 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:39:04,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1575795311, now seen corresponding path program 1 times [2024-10-13 23:39:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741128457] [2024-10-13 23:39:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-13 23:39:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741128457] [2024-10-13 23:39:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741128457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:04,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141981552] [2024-10-13 23:39:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:04,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:39:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:39:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:04,668 INFO L87 Difference]: Start difference. First operand 50719 states and 55666 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:11,090 INFO L93 Difference]: Finished difference Result 167738 states and 183935 transitions. [2024-10-13 23:39:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:39:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2024-10-13 23:39:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:11,214 INFO L225 Difference]: With dead ends: 167738 [2024-10-13 23:39:11,214 INFO L226 Difference]: Without dead ends: 117807 [2024-10-13 23:39:11,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:11,243 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 1678 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6575 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 7529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 6575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:11,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 888 Invalid, 7529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 6575 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-13 23:39:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117807 states. [2024-10-13 23:39:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117807 to 115333. [2024-10-13 23:39:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115333 states, 115332 states have (on average 1.0877553497728298) internal successors, (125453), 115332 states have internal predecessors, (125453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115333 states to 115333 states and 125453 transitions. [2024-10-13 23:39:12,974 INFO L78 Accepts]: Start accepts. Automaton has 115333 states and 125453 transitions. Word has length 362 [2024-10-13 23:39:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 115333 states and 125453 transitions. [2024-10-13 23:39:12,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 115333 states and 125453 transitions. [2024-10-13 23:39:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-10-13 23:39:12,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:12,982 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:12,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:39:12,982 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:12,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1630885465, now seen corresponding path program 1 times [2024-10-13 23:39:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:12,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528620877] [2024-10-13 23:39:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:12,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 323 proven. 113 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-13 23:39:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528620877] [2024-10-13 23:39:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528620877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:39:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498557273] [2024-10-13 23:39:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:14,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:14,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:39:14,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:39:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:14,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:39:14,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:39:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-13 23:39:15,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:39:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498557273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:39:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-13 23:39:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803635849] [2024-10-13 23:39:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:15,476 INFO L87 Difference]: Start difference. First operand 115333 states and 125453 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:18,701 INFO L93 Difference]: Finished difference Result 224373 states and 244426 transitions. [2024-10-13 23:39:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:18,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2024-10-13 23:39:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:18,835 INFO L225 Difference]: With dead ends: 224373 [2024-10-13 23:39:18,835 INFO L226 Difference]: Without dead ends: 119278 [2024-10-13 23:39:19,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:19,049 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 682 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:19,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1157 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:39:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119278 states. [2024-10-13 23:39:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119278 to 117694. [2024-10-13 23:39:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117694 states, 117693 states have (on average 1.0789511695682836) internal successors, (126985), 117693 states have internal predecessors, (126985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117694 states to 117694 states and 126985 transitions. [2024-10-13 23:39:20,694 INFO L78 Accepts]: Start accepts. Automaton has 117694 states and 126985 transitions. Word has length 405 [2024-10-13 23:39:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:20,694 INFO L471 AbstractCegarLoop]: Abstraction has 117694 states and 126985 transitions. [2024-10-13 23:39:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 117694 states and 126985 transitions. [2024-10-13 23:39:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-10-13 23:39:20,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:20,702 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:20,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:39:20,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:39:20,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:20,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1578301084, now seen corresponding path program 1 times [2024-10-13 23:39:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724481533] [2024-10-13 23:39:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-13 23:39:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724481533] [2024-10-13 23:39:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724481533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:21,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:21,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630860127] [2024-10-13 23:39:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:21,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:21,370 INFO L87 Difference]: Start difference. First operand 117694 states and 126985 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)