./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-?-c7c6ca5-m [2024-11-08 11:21:28,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:21:28,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:21:28,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:21:28,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:21:28,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:21:28,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:21:28,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:21:28,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:21:28,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:21:28,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:21:28,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:21:28,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:21:28,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:21:28,935 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:21:28,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:21:28,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:21:28,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:21:28,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:21:28,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:21:28,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:21:28,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:21:28,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:21:28,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:21:28,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:21:28,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:21:28,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:21:28,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:21:28,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:21:28,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:21:28,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:21:28,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:21:28,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:21:28,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:21:28,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:21:28,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:21:28,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:21:28,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:21:28,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:21:28,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:21:28,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:21:28,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:21:28,944 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-11-08 11:21:29,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:21:29,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:21:29,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:21:29,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:21:29,221 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:21:29,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label28.c [2024-11-08 11:21:30,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:21:30,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:21:30,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c [2024-11-08 11:21:30,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb241ec1e/ba2b628c0e734b5482edb1c974fa9510/FLAGc4fe99ee6 [2024-11-08 11:21:31,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb241ec1e/ba2b628c0e734b5482edb1c974fa9510 [2024-11-08 11:21:31,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:21:31,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:21:31,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:21:31,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:21:31,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:21:31,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:21:31" (1/1) ... [2024-11-08 11:21:31,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786370ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:31, skipping insertion in model container [2024-11-08 11:21:31,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:21:31" (1/1) ... [2024-11-08 11:21:31,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:21:31,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c[2473,2486] [2024-11-08 11:21:32,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:21:32,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:21:32,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c[2473,2486] [2024-11-08 11:21:32,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:21:32,462 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:21:32,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32 WrapperNode [2024-11-08 11:21:32,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:21:32,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:21:32,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:21:32,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:21:32,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:32,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:32,974 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:21:32,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:21:32,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:21:32,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:21:32,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:21:32,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:32,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,371 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:21:33,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:21:33,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:21:33,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:21:33,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:21:33,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (1/1) ... [2024-11-08 11:21:33,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:21:33,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:21:33,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:21:33,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:21:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:21:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:21:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:21:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:21:33,804 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:21:33,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:21:38,624 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:21:38,624 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:21:38,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:21:38,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:21:38,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:38 BoogieIcfgContainer [2024-11-08 11:21:38,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:21:38,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:21:38,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:21:38,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:21:38,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:21:31" (1/3) ... [2024-11-08 11:21:38,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a15166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:21:38, skipping insertion in model container [2024-11-08 11:21:38,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:32" (2/3) ... [2024-11-08 11:21:38,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a15166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:21:38, skipping insertion in model container [2024-11-08 11:21:38,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:38" (3/3) ... [2024-11-08 11:21:38,666 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label28.c [2024-11-08 11:21:38,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:21:38,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:21:38,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:21:38,747 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;@2de6b8a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:21:38,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:21:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 11:21:38,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:38,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:38,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:38,763 INFO L85 PathProgramCache]: Analyzing trace with hash -884752143, now seen corresponding path program 1 times [2024-11-08 11:21:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175490600] [2024-11-08 11:21:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:39,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175490600] [2024-11-08 11:21:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175490600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:39,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651656954] [2024-11-08 11:21:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:39,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:39,136 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:42,725 INFO L93 Difference]: Finished difference Result 3082 states and 5689 transitions. [2024-11-08 11:21:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-08 11:21:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:42,747 INFO L225 Difference]: With dead ends: 3082 [2024-11-08 11:21:42,747 INFO L226 Difference]: Without dead ends: 1899 [2024-11-08 11:21:42,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:42,755 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1024 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:42,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 641 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 11:21:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-08 11:21:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2024-11-08 11:21:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2024-11-08 11:21:42,843 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 15 [2024-11-08 11:21:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:42,844 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2024-11-08 11:21:42,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2024-11-08 11:21:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 11:21:42,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:42,846 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] [2024-11-08 11:21:42,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:21:42,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:42,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 719746634, now seen corresponding path program 1 times [2024-11-08 11:21:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:42,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398899700] [2024-11-08 11:21:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:43,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398899700] [2024-11-08 11:21:43,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398899700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:43,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:43,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882391335] [2024-11-08 11:21:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:43,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:43,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:43,209 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:46,238 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2024-11-08 11:21:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:46,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-08 11:21:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:46,250 INFO L225 Difference]: With dead ends: 5384 [2024-11-08 11:21:46,250 INFO L226 Difference]: Without dead ends: 3492 [2024-11-08 11:21:46,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:46,253 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:46,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1013 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:21:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-08 11:21:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2024-11-08 11:21:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2024-11-08 11:21:46,300 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 80 [2024-11-08 11:21:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:46,301 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2024-11-08 11:21:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2024-11-08 11:21:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 11:21:46,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:46,303 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] [2024-11-08 11:21:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:21:46,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1405100497, now seen corresponding path program 1 times [2024-11-08 11:21:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128704340] [2024-11-08 11:21:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:46,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128704340] [2024-11-08 11:21:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128704340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:46,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171131736] [2024-11-08 11:21:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:46,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:46,425 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:49,715 INFO L93 Difference]: Finished difference Result 10169 states and 15700 transitions. [2024-11-08 11:21:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-08 11:21:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:49,736 INFO L225 Difference]: With dead ends: 10169 [2024-11-08 11:21:49,736 INFO L226 Difference]: Without dead ends: 6680 [2024-11-08 11:21:49,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:49,743 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:49,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 847 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:21:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2024-11-08 11:21:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6669. [2024-11-08 11:21:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6669 states, 6668 states have (on average 1.375224955008998) internal successors, (9170), 6668 states have internal predecessors, (9170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6669 states to 6669 states and 9170 transitions. [2024-11-08 11:21:49,863 INFO L78 Accepts]: Start accepts. Automaton has 6669 states and 9170 transitions. Word has length 82 [2024-11-08 11:21:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:49,865 INFO L471 AbstractCegarLoop]: Abstraction has 6669 states and 9170 transitions. [2024-11-08 11:21:49,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6669 states and 9170 transitions. [2024-11-08 11:21:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 11:21:49,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:49,869 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] [2024-11-08 11:21:49,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:21:49,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -770747971, now seen corresponding path program 1 times [2024-11-08 11:21:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:49,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461349114] [2024-11-08 11:21:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:50,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461349114] [2024-11-08 11:21:50,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461349114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:50,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795386312] [2024-11-08 11:21:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:50,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:50,057 INFO L87 Difference]: Start difference. First operand 6669 states and 9170 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:53,112 INFO L93 Difference]: Finished difference Result 19656 states and 27046 transitions. [2024-11-08 11:21:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:53,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-08 11:21:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:53,152 INFO L225 Difference]: With dead ends: 19656 [2024-11-08 11:21:53,153 INFO L226 Difference]: Without dead ends: 12989 [2024-11-08 11:21:53,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:53,167 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 853 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:53,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1151 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:21:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2024-11-08 11:21:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 12972. [2024-11-08 11:21:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2366818286947807) internal successors, (16041), 12971 states have internal predecessors, (16041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16041 transitions. [2024-11-08 11:21:53,332 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16041 transitions. Word has length 126 [2024-11-08 11:21:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16041 transitions. [2024-11-08 11:21:53,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16041 transitions. [2024-11-08 11:21:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 11:21:53,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:53,338 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, 1] [2024-11-08 11:21:53,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:21:53,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:53,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash -741796308, now seen corresponding path program 1 times [2024-11-08 11:21:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176115650] [2024-11-08 11:21:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176115650] [2024-11-08 11:21:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176115650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358404891] [2024-11-08 11:21:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:53,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:53,547 INFO L87 Difference]: Start difference. First operand 12972 states and 16041 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:56,463 INFO L93 Difference]: Finished difference Result 22792 states and 28661 transitions. [2024-11-08 11:21:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-11-08 11:21:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:56,482 INFO L225 Difference]: With dead ends: 22792 [2024-11-08 11:21:56,482 INFO L226 Difference]: Without dead ends: 12980 [2024-11-08 11:21:56,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:56,492 INFO L432 NwaCegarLoop]: 1028 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:56,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1212 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:21:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12980 states. [2024-11-08 11:21:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12980 to 12972. [2024-11-08 11:21:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2351399275306454) internal successors, (16021), 12971 states have internal predecessors, (16021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16021 transitions. [2024-11-08 11:21:56,623 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16021 transitions. Word has length 131 [2024-11-08 11:21:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:56,623 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16021 transitions. [2024-11-08 11:21:56,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16021 transitions. [2024-11-08 11:21:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-08 11:21:56,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:56,630 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, 1] [2024-11-08 11:21:56,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:21:56,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:56,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1937391824, now seen corresponding path program 1 times [2024-11-08 11:21:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172507067] [2024-11-08 11:21:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172507067] [2024-11-08 11:21:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172507067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:56,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068107326] [2024-11-08 11:21:56,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:56,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:56,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:56,769 INFO L87 Difference]: Start difference. First operand 12972 states and 16021 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:00,091 INFO L93 Difference]: Finished difference Result 36166 states and 45139 transitions. [2024-11-08 11:22:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:00,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2024-11-08 11:22:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:00,145 INFO L225 Difference]: With dead ends: 36166 [2024-11-08 11:22:00,146 INFO L226 Difference]: Without dead ends: 23196 [2024-11-08 11:22:00,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:00,161 INFO L432 NwaCegarLoop]: 1850 mSDtfsCounter, 841 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:00,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1988 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:22:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23196 states. [2024-11-08 11:22:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23196 to 22404. [2024-11-08 11:22:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22404 states, 22403 states have (on average 1.1934115966611614) internal successors, (26736), 22403 states have internal predecessors, (26736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22404 states to 22404 states and 26736 transitions. [2024-11-08 11:22:00,438 INFO L78 Accepts]: Start accepts. Automaton has 22404 states and 26736 transitions. Word has length 229 [2024-11-08 11:22:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:00,439 INFO L471 AbstractCegarLoop]: Abstraction has 22404 states and 26736 transitions. [2024-11-08 11:22:00,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22404 states and 26736 transitions. [2024-11-08 11:22:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 11:22:00,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:00,443 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] [2024-11-08 11:22:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:22:00,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:00,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash -142749065, now seen corresponding path program 1 times [2024-11-08 11:22:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858152740] [2024-11-08 11:22:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 11:22:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:00,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858152740] [2024-11-08 11:22:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858152740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422145126] [2024-11-08 11:22:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:00,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:00,928 INFO L87 Difference]: Start difference. First operand 22404 states and 26736 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:03,680 INFO L93 Difference]: Finished difference Result 44019 states and 52673 transitions. [2024-11-08 11:22:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 244 [2024-11-08 11:22:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:03,734 INFO L225 Difference]: With dead ends: 44019 [2024-11-08 11:22:03,738 INFO L226 Difference]: Without dead ends: 22404 [2024-11-08 11:22:03,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:03,767 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:03,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1196 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:22:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22404 states. [2024-11-08 11:22:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22404 to 22404. [2024-11-08 11:22:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22404 states, 22403 states have (on average 1.1931884122662144) internal successors, (26731), 22403 states have internal predecessors, (26731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22404 states to 22404 states and 26731 transitions. [2024-11-08 11:22:04,035 INFO L78 Accepts]: Start accepts. Automaton has 22404 states and 26731 transitions. Word has length 244 [2024-11-08 11:22:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:04,036 INFO L471 AbstractCegarLoop]: Abstraction has 22404 states and 26731 transitions. [2024-11-08 11:22:04,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22404 states and 26731 transitions. [2024-11-08 11:22:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 11:22:04,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:04,040 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, 1] [2024-11-08 11:22:04,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:22:04,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:04,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1521446496, now seen corresponding path program 1 times [2024-11-08 11:22:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573527245] [2024-11-08 11:22:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 11:22:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573527245] [2024-11-08 11:22:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573527245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913848425] [2024-11-08 11:22:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:04,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:04,218 INFO L87 Difference]: Start difference. First operand 22404 states and 26731 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:07,425 INFO L93 Difference]: Finished difference Result 55046 states and 66948 transitions. [2024-11-08 11:22:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 251 [2024-11-08 11:22:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:07,460 INFO L225 Difference]: With dead ends: 55046 [2024-11-08 11:22:07,460 INFO L226 Difference]: Without dead ends: 33431 [2024-11-08 11:22:07,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:07,478 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 882 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:07,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 928 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:22:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33431 states. [2024-11-08 11:22:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33431 to 32635. [2024-11-08 11:22:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32635 states, 32634 states have (on average 1.176135318992462) internal successors, (38382), 32634 states have internal predecessors, (38382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32635 states to 32635 states and 38382 transitions. [2024-11-08 11:22:07,755 INFO L78 Accepts]: Start accepts. Automaton has 32635 states and 38382 transitions. Word has length 251 [2024-11-08 11:22:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:07,756 INFO L471 AbstractCegarLoop]: Abstraction has 32635 states and 38382 transitions. [2024-11-08 11:22:07,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 32635 states and 38382 transitions. [2024-11-08 11:22:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-08 11:22:07,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:07,759 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, 1] [2024-11-08 11:22:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:22:07,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash -406385595, now seen corresponding path program 1 times [2024-11-08 11:22:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875348200] [2024-11-08 11:22:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:22:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875348200] [2024-11-08 11:22:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875348200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:07,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:07,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015147275] [2024-11-08 11:22:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:07,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:07,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:07,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:07,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:07,914 INFO L87 Difference]: Start difference. First operand 32635 states and 38382 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:11,016 INFO L93 Difference]: Finished difference Result 76294 states and 91193 transitions. [2024-11-08 11:22:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 306 [2024-11-08 11:22:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:11,068 INFO L225 Difference]: With dead ends: 76294 [2024-11-08 11:22:11,068 INFO L226 Difference]: Without dead ends: 44448 [2024-11-08 11:22:11,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:11,091 INFO L432 NwaCegarLoop]: 1806 mSDtfsCounter, 849 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:11,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1950 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:22:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44448 states. [2024-11-08 11:22:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44448 to 43657. [2024-11-08 11:22:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43657 states, 43656 states have (on average 1.151663001649258) internal successors, (50277), 43656 states have internal predecessors, (50277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43657 states to 43657 states and 50277 transitions. [2024-11-08 11:22:11,462 INFO L78 Accepts]: Start accepts. Automaton has 43657 states and 50277 transitions. Word has length 306 [2024-11-08 11:22:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:11,463 INFO L471 AbstractCegarLoop]: Abstraction has 43657 states and 50277 transitions. [2024-11-08 11:22:11,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 43657 states and 50277 transitions. [2024-11-08 11:22:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-08 11:22:11,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:11,467 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, 1] [2024-11-08 11:22:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:22:11,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 624236473, now seen corresponding path program 1 times [2024-11-08 11:22:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:11,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907056306] [2024-11-08 11:22:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 113 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 11:22:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907056306] [2024-11-08 11:22:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907056306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:22:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988818397] [2024-11-08 11:22:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:12,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:22:12,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:22:12,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:22:12,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:22:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:12,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:22:12,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:22:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 11:22:12,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:22:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988818397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:12,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:22:12,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:22:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886088254] [2024-11-08 11:22:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:12,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:22:12,685 INFO L87 Difference]: Start difference. First operand 43657 states and 50277 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:15,761 INFO L93 Difference]: Finished difference Result 86516 states and 99752 transitions. [2024-11-08 11:22:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:15,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 321 [2024-11-08 11:22:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:15,814 INFO L225 Difference]: With dead ends: 86516 [2024-11-08 11:22:15,814 INFO L226 Difference]: Without dead ends: 43648 [2024-11-08 11:22:15,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 320 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-11-08 11:22:15,852 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 1076 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:15,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 818 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:22:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43648 states. [2024-11-08 11:22:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43648 to 43647. [2024-11-08 11:22:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43647 states, 43646 states have (on average 1.1132749851074555) internal successors, (48590), 43646 states have internal predecessors, (48590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43647 states to 43647 states and 48590 transitions. [2024-11-08 11:22:16,258 INFO L78 Accepts]: Start accepts. Automaton has 43647 states and 48590 transitions. Word has length 321 [2024-11-08 11:22:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 43647 states and 48590 transitions. [2024-11-08 11:22:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43647 states and 48590 transitions. [2024-11-08 11:22:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-08 11:22:16,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:16,267 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, 1] [2024-11-08 11:22:16,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:22:16,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 11:22:16,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:16,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1590721991, now seen corresponding path program 1 times [2024-11-08 11:22:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:16,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300496320] [2024-11-08 11:22:16,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:16,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-11-08 11:22:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300496320] [2024-11-08 11:22:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300496320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216502707] [2024-11-08 11:22:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:16,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:16,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:16,879 INFO L87 Difference]: Start difference. First operand 43647 states and 48590 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:19,220 INFO L93 Difference]: Finished difference Result 86503 states and 96385 transitions. [2024-11-08 11:22:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:19,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2024-11-08 11:22:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:19,407 INFO L225 Difference]: With dead ends: 86503 [2024-11-08 11:22:19,407 INFO L226 Difference]: Without dead ends: 43645 [2024-11-08 11:22:19,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:19,418 INFO L432 NwaCegarLoop]: 1342 mSDtfsCounter, 1187 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:19,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1421 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:22:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43645 states. [2024-11-08 11:22:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43645 to 43644. [2024-11-08 11:22:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43644 states, 43643 states have (on average 1.086588914602571) internal successors, (47422), 43643 states have internal predecessors, (47422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43644 states to 43644 states and 47422 transitions. [2024-11-08 11:22:19,743 INFO L78 Accepts]: Start accepts. Automaton has 43644 states and 47422 transitions. Word has length 340 [2024-11-08 11:22:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:19,744 INFO L471 AbstractCegarLoop]: Abstraction has 43644 states and 47422 transitions. [2024-11-08 11:22:19,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43644 states and 47422 transitions. [2024-11-08 11:22:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-08 11:22:19,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:19,748 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, 1] [2024-11-08 11:22:19,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:22:19,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:19,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1684613318, now seen corresponding path program 1 times [2024-11-08 11:22:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:19,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693968489] [2024-11-08 11:22:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 11:22:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:19,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693968489] [2024-11-08 11:22:19,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693968489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:19,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:19,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068290011] [2024-11-08 11:22:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:19,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:22:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:19,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:22:19,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:22:19,914 INFO L87 Difference]: Start difference. First operand 43644 states and 47422 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:25,625 INFO L93 Difference]: Finished difference Result 150460 states and 163810 transitions. [2024-11-08 11:22:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:22:25,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 363 [2024-11-08 11:22:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:25,735 INFO L225 Difference]: With dead ends: 150460 [2024-11-08 11:22:25,735 INFO L226 Difference]: Without dead ends: 107605 [2024-11-08 11:22:25,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:22:25,771 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 1713 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 6004 mSolverCounterSat, 1094 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 7098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1094 IncrementalHoareTripleChecker+Valid, 6004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:25,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 755 Invalid, 7098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1094 Valid, 6004 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 11:22:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107605 states. [2024-11-08 11:22:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107605 to 104326. [2024-11-08 11:22:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104326 states, 104325 states have (on average 1.0794344596213754) internal successors, (112612), 104325 states have internal predecessors, (112612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104326 states to 104326 states and 112612 transitions. [2024-11-08 11:22:26,879 INFO L78 Accepts]: Start accepts. Automaton has 104326 states and 112612 transitions. Word has length 363 [2024-11-08 11:22:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:26,879 INFO L471 AbstractCegarLoop]: Abstraction has 104326 states and 112612 transitions. [2024-11-08 11:22:26,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 104326 states and 112612 transitions. [2024-11-08 11:22:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-08 11:22:27,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:27,209 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, 1] [2024-11-08 11:22:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:22:27,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1234351376, now seen corresponding path program 1 times [2024-11-08 11:22:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176439599] [2024-11-08 11:22:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 326 proven. 110 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 11:22:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176439599] [2024-11-08 11:22:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176439599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:22:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797820093] [2024-11-08 11:22:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:28,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:22:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:22:28,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:22:28,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:22:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:28,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:22:28,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:22:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 11:22:28,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:22:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797820093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:22:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 11:22:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560502318] [2024-11-08 11:22:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:22:28,973 INFO L87 Difference]: Start difference. First operand 104326 states and 112612 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:31,758 INFO L93 Difference]: Finished difference Result 202358 states and 218743 transitions. [2024-11-08 11:22:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 406 [2024-11-08 11:22:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:31,878 INFO L225 Difference]: With dead ends: 202358 [2024-11-08 11:22:31,878 INFO L226 Difference]: Without dead ends: 108272 [2024-11-08 11:22:31,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:22:31,915 INFO L432 NwaCegarLoop]: 1033 mSDtfsCounter, 683 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:31,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1167 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:22:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108272 states. [2024-11-08 11:22:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108272 to 106688. [2024-11-08 11:22:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106688 states, 106687 states have (on average 1.0717519472850487) internal successors, (114342), 106687 states have internal predecessors, (114342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106688 states to 106688 states and 114342 transitions. [2024-11-08 11:22:33,339 INFO L78 Accepts]: Start accepts. Automaton has 106688 states and 114342 transitions. Word has length 406 [2024-11-08 11:22:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:33,339 INFO L471 AbstractCegarLoop]: Abstraction has 106688 states and 114342 transitions. [2024-11-08 11:22:33,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 106688 states and 114342 transitions. [2024-11-08 11:22:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-08 11:22:33,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:33,345 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, 1] [2024-11-08 11:22:33,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:22:33,545 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,SelfDestructingSolverStorable12 [2024-11-08 11:22:33,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:33,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash 863507, now seen corresponding path program 1 times [2024-11-08 11:22:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:33,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668902418] [2024-11-08 11:22:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-08 11:22:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668902418] [2024-11-08 11:22:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668902418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989328206] [2024-11-08 11:22:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:34,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:34,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:34,057 INFO L87 Difference]: Start difference. First operand 106688 states and 114342 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:37,060 INFO L93 Difference]: Finished difference Result 214166 states and 229485 transitions. [2024-11-08 11:22:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 452 [2024-11-08 11:22:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:37,309 INFO L225 Difference]: With dead ends: 214166 [2024-11-08 11:22:37,310 INFO L226 Difference]: Without dead ends: 108267 [2024-11-08 11:22:37,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:37,341 INFO L432 NwaCegarLoop]: 1351 mSDtfsCounter, 938 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:37,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1436 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:22:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108267 states. [2024-11-08 11:22:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108267 to 106678. [2024-11-08 11:22:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106678 states, 106677 states have (on average 1.0612034459161768) internal successors, (113206), 106677 states have internal predecessors, (113206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106678 states to 106678 states and 113206 transitions. [2024-11-08 11:22:38,697 INFO L78 Accepts]: Start accepts. Automaton has 106678 states and 113206 transitions. Word has length 452 [2024-11-08 11:22:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:38,698 INFO L471 AbstractCegarLoop]: Abstraction has 106678 states and 113206 transitions. [2024-11-08 11:22:38,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 106678 states and 113206 transitions. [2024-11-08 11:22:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-08 11:22:38,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:38,704 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:38,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:22:38,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:38,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1364798383, now seen corresponding path program 1 times [2024-11-08 11:22:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243620459] [2024-11-08 11:22:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-08 11:22:39,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:39,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243620459] [2024-11-08 11:22:39,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243620459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:39,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:39,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167364266] [2024-11-08 11:22:39,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:39,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:39,209 INFO L87 Difference]: Start difference. First operand 106678 states and 113206 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:42,501 INFO L93 Difference]: Finished difference Result 237756 states and 253279 transitions. [2024-11-08 11:22:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 476 [2024-11-08 11:22:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:42,825 INFO L225 Difference]: With dead ends: 237756 [2024-11-08 11:22:42,825 INFO L226 Difference]: Without dead ends: 131867 [2024-11-08 11:22:42,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:42,903 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 876 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:42,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 745 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 11:22:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131867 states. [2024-11-08 11:22:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131867 to 130274. [2024-11-08 11:22:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130274 states, 130273 states have (on average 1.059306226155842) internal successors, (137999), 130273 states have internal predecessors, (137999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130274 states to 130274 states and 137999 transitions. [2024-11-08 11:22:44,676 INFO L78 Accepts]: Start accepts. Automaton has 130274 states and 137999 transitions. Word has length 476 [2024-11-08 11:22:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 130274 states and 137999 transitions. [2024-11-08 11:22:44,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 130274 states and 137999 transitions. [2024-11-08 11:22:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-11-08 11:22:44,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:44,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:22:44,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash -942422012, now seen corresponding path program 1 times [2024-11-08 11:22:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:44,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025165455] [2024-11-08 11:22:44,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-08 11:22:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025165455] [2024-11-08 11:22:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025165455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788074968] [2024-11-08 11:22:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:44,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:44,938 INFO L87 Difference]: Start difference. First operand 130274 states and 137999 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:47,110 INFO L93 Difference]: Finished difference Result 245571 states and 260677 transitions. [2024-11-08 11:22:47,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 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 493 [2024-11-08 11:22:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:47,250 INFO L225 Difference]: With dead ends: 245571 [2024-11-08 11:22:47,250 INFO L226 Difference]: Without dead ends: 129471 [2024-11-08 11:22:47,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:47,304 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1610 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:47,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 294 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 11:22:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129471 states. [2024-11-08 11:22:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129471 to 129470. [2024-11-08 11:22:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129470 states, 129469 states have (on average 1.0591261228556643) internal successors, (137124), 129469 states have internal predecessors, (137124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129470 states to 129470 states and 137124 transitions. [2024-11-08 11:22:49,069 INFO L78 Accepts]: Start accepts. Automaton has 129470 states and 137124 transitions. Word has length 493 [2024-11-08 11:22:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 129470 states and 137124 transitions. [2024-11-08 11:22:49,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 129470 states and 137124 transitions. [2024-11-08 11:22:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-11-08 11:22:49,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:49,086 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-08 11:22:49,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:22:49,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:49,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash 84700328, now seen corresponding path program 1 times [2024-11-08 11:22:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669138583] [2024-11-08 11:22:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-08 11:22:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669138583] [2024-11-08 11:22:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669138583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:49,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:49,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411838215] [2024-11-08 11:22:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:49,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:49,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:49,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:49,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:49,327 INFO L87 Difference]: Start difference. First operand 129470 states and 137124 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:52,979 INFO L93 Difference]: Finished difference Result 258954 states and 274249 transitions. [2024-11-08 11:22:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:52,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 495 [2024-11-08 11:22:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:53,127 INFO L225 Difference]: With dead ends: 258954 [2024-11-08 11:22:53,128 INFO L226 Difference]: Without dead ends: 128699 [2024-11-08 11:22:53,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:53,176 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 791 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:53,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1800 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:22:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128699 states. [2024-11-08 11:22:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128699 to 127107. [2024-11-08 11:22:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127107 states, 127106 states have (on average 1.0460088430129184) internal successors, (132954), 127106 states have internal predecessors, (132954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127107 states to 127107 states and 132954 transitions. [2024-11-08 11:22:54,721 INFO L78 Accepts]: Start accepts. Automaton has 127107 states and 132954 transitions. Word has length 495 [2024-11-08 11:22:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:54,721 INFO L471 AbstractCegarLoop]: Abstraction has 127107 states and 132954 transitions. [2024-11-08 11:22:54,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 127107 states and 132954 transitions. [2024-11-08 11:22:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-08 11:22:54,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:54,730 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, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:22:54,731 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash -230342840, now seen corresponding path program 1 times [2024-11-08 11:22:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474445418] [2024-11-08 11:22:54,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-08 11:22:55,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:55,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474445418] [2024-11-08 11:22:55,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474445418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:55,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:55,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805304033] [2024-11-08 11:22:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:55,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:55,393 INFO L87 Difference]: Start difference. First operand 127107 states and 132954 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)