/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 16:19:32,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 16:19:32,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 16:19:32,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 16:19:32,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 16:19:32,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 16:19:32,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 16:19:32,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 16:19:32,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 16:19:32,878 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 16:19:32,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 16:19:32,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 16:19:32,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 16:19:32,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 16:19:32,881 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 16:19:32,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 16:19:32,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 16:19:32,881 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 16:19:32,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 16:19:32,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 16:19:32,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 16:19:32,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 16:19:32,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 16:19:32,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 16:19:32,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 16:19:32,883 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 16:19:32,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 16:19:32,884 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 16:19:32,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 16:19:32,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 16:19:32,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 16:19:32,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 16:19:32,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:19:32,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 16:19:32,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 16:19:32,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 16:19:32,887 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: Use bitabs translation -> true [2023-12-19 16:19:33,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 16:19:33,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 16:19:33,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 16:19:33,076 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 16:19:33,076 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 16:19:33,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2023-12-19 16:19:34,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 16:19:34,199 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 16:19:34,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2023-12-19 16:19:34,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887534e76/67849a18c7d140658da0231f9cf8b5ad/FLAG702212f60 [2023-12-19 16:19:34,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887534e76/67849a18c7d140658da0231f9cf8b5ad [2023-12-19 16:19:34,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 16:19:34,217 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 16:19:34,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 16:19:34,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 16:19:34,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 16:19:34,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d89d7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34, skipping insertion in model container [2023-12-19 16:19:34,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 16:19:34,348 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i[917,930] [2023-12-19 16:19:34,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:19:34,392 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 16:19:34,400 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i[917,930] [2023-12-19 16:19:34,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:19:34,434 INFO L206 MainTranslator]: Completed translation [2023-12-19 16:19:34,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34 WrapperNode [2023-12-19 16:19:34,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 16:19:34,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 16:19:34,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 16:19:34,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 16:19:34,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,483 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2023-12-19 16:19:34,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 16:19:34,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 16:19:34,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 16:19:34,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 16:19:34,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,507 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2023-12-19 16:19:34,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 16:19:34,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 16:19:34,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 16:19:34,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 16:19:34,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (1/1) ... [2023-12-19 16:19:34,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:19:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:19:34,547 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) [2023-12-19 16:19:34,565 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 [2023-12-19 16:19:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 16:19:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 16:19:34,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 16:19:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 16:19:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 16:19:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 16:19:34,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 16:19:34,666 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 16:19:34,667 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 16:19:34,945 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 16:19:34,970 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 16:19:34,971 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 16:19:34,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:19:34 BoogieIcfgContainer [2023-12-19 16:19:34,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 16:19:34,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 16:19:34,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 16:19:34,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 16:19:34,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:19:34" (1/3) ... [2023-12-19 16:19:34,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e07f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:19:34, skipping insertion in model container [2023-12-19 16:19:34,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:19:34" (2/3) ... [2023-12-19 16:19:34,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e07f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:19:34, skipping insertion in model container [2023-12-19 16:19:34,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:19:34" (3/3) ... [2023-12-19 16:19:34,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-76.i [2023-12-19 16:19:34,988 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 16:19:34,988 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 16:19:35,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 16:19:35,043 INFO L357 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, mHoare=true, 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;@6e0c20da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 16:19:35,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 16:19:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 16:19:35,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:35,057 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:35,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:35,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2023-12-19 16:19:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:35,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270732869] [2023-12-19 16:19:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270732869] [2023-12-19 16:19:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270732869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 16:19:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160158321] [2023-12-19 16:19:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:35,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 16:19:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 16:19:35,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:19:35,373 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 16:19:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:35,415 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-19 16:19:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 16:19:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-19 16:19:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:35,423 INFO L225 Difference]: With dead ends: 183 [2023-12-19 16:19:35,423 INFO L226 Difference]: Without dead ends: 89 [2023-12-19 16:19:35,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:19:35,430 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:35,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:19:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-19 16:19:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-19 16:19:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-19 16:19:35,476 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-19 16:19:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:35,477 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-19 16:19:35,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 16:19:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-19 16:19:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 16:19:35,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:35,485 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:35,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 16:19:35,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:35,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2023-12-19 16:19:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665985858] [2023-12-19 16:19:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665985858] [2023-12-19 16:19:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665985858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:19:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079182421] [2023-12-19 16:19:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:35,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:19:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:19:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:35,844 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:35,873 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-19 16:19:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:19:35,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-19 16:19:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:35,875 INFO L225 Difference]: With dead ends: 177 [2023-12-19 16:19:35,875 INFO L226 Difference]: Without dead ends: 89 [2023-12-19 16:19:35,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:35,880 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:35,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:19:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-19 16:19:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-19 16:19:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-19 16:19:35,894 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-19 16:19:35,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:35,895 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-19 16:19:35,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-19 16:19:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 16:19:35,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:35,897 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:35,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 16:19:35,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:35,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2023-12-19 16:19:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007743469] [2023-12-19 16:19:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:37,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007743469] [2023-12-19 16:19:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007743469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:37,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:19:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739218681] [2023-12-19 16:19:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:37,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:19:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:19:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:19:37,311 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:37,699 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2023-12-19 16:19:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:19:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-19 16:19:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:37,703 INFO L225 Difference]: With dead ends: 225 [2023-12-19 16:19:37,704 INFO L226 Difference]: Without dead ends: 137 [2023-12-19 16:19:37,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:19:37,707 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 290 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:37,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 431 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:19:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-19 16:19:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2023-12-19 16:19:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-12-19 16:19:37,726 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 115 [2023-12-19 16:19:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:37,726 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-12-19 16:19:37,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-12-19 16:19:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 16:19:37,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:37,730 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:37,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 16:19:37,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:37,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2023-12-19 16:19:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234152428] [2023-12-19 16:19:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:37,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234152428] [2023-12-19 16:19:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234152428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:37,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:19:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182724744] [2023-12-19 16:19:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:37,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:19:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:19:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:37,852 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:37,866 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2023-12-19 16:19:37,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:19:37,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-19 16:19:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:37,868 INFO L225 Difference]: With dead ends: 204 [2023-12-19 16:19:37,868 INFO L226 Difference]: Without dead ends: 99 [2023-12-19 16:19:37,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:37,869 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:37,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 218 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:19:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-19 16:19:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-19 16:19:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2023-12-19 16:19:37,876 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 115 [2023-12-19 16:19:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:37,876 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2023-12-19 16:19:37,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2023-12-19 16:19:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 16:19:37,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:37,877 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:37,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 16:19:37,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:37,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1995083643, now seen corresponding path program 1 times [2023-12-19 16:19:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670431030] [2023-12-19 16:19:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670431030] [2023-12-19 16:19:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670431030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:19:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425694682] [2023-12-19 16:19:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:19:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:19:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:19:38,192 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:38,417 INFO L93 Difference]: Finished difference Result 198 states and 280 transitions. [2023-12-19 16:19:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:19:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-19 16:19:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:38,419 INFO L225 Difference]: With dead ends: 198 [2023-12-19 16:19:38,419 INFO L226 Difference]: Without dead ends: 100 [2023-12-19 16:19:38,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:19:38,422 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 91 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:38,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 353 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:19:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-19 16:19:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-12-19 16:19:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2023-12-19 16:19:38,434 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 117 [2023-12-19 16:19:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:38,435 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2023-12-19 16:19:38,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2023-12-19 16:19:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 16:19:38,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:38,437 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:38,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 16:19:38,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:38,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2023-12-19 16:19:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349849489] [2023-12-19 16:19:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:38,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:38,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349849489] [2023-12-19 16:19:38,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349849489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:38,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:38,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:19:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58261424] [2023-12-19 16:19:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:38,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:19:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:19:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:38,528 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:38,544 INFO L93 Difference]: Finished difference Result 215 states and 303 transitions. [2023-12-19 16:19:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:19:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-19 16:19:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:38,545 INFO L225 Difference]: With dead ends: 215 [2023-12-19 16:19:38,545 INFO L226 Difference]: Without dead ends: 117 [2023-12-19 16:19:38,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:38,546 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:38,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:19:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-19 16:19:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-12-19 16:19:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2023-12-19 16:19:38,553 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 117 [2023-12-19 16:19:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:38,553 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2023-12-19 16:19:38,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2023-12-19 16:19:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 16:19:38,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:38,554 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:38,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 16:19:38,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:38,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1080589313, now seen corresponding path program 1 times [2023-12-19 16:19:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:38,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381480951] [2023-12-19 16:19:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:38,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:38,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381480951] [2023-12-19 16:19:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381480951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:38,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:19:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099295404] [2023-12-19 16:19:38,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:19:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:19:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:38,641 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:38,660 INFO L93 Difference]: Finished difference Result 199 states and 279 transitions. [2023-12-19 16:19:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:19:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-19 16:19:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:38,661 INFO L225 Difference]: With dead ends: 199 [2023-12-19 16:19:38,661 INFO L226 Difference]: Without dead ends: 101 [2023-12-19 16:19:38,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:19:38,662 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:38,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:19:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-19 16:19:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-19 16:19:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2023-12-19 16:19:38,671 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 119 [2023-12-19 16:19:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:38,671 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2023-12-19 16:19:38,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2023-12-19 16:19:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 16:19:38,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:38,673 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:38,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 16:19:38,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:38,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 493783299, now seen corresponding path program 1 times [2023-12-19 16:19:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261197047] [2023-12-19 16:19:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261197047] [2023-12-19 16:19:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261197047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:39,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:19:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708735023] [2023-12-19 16:19:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:39,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:19:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:19:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:19:39,442 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 16:19:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:39,846 INFO L93 Difference]: Finished difference Result 234 states and 322 transitions. [2023-12-19 16:19:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:19:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-12-19 16:19:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:39,847 INFO L225 Difference]: With dead ends: 234 [2023-12-19 16:19:39,847 INFO L226 Difference]: Without dead ends: 134 [2023-12-19 16:19:39,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:19:39,848 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 311 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:39,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 373 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:19:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-19 16:19:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2023-12-19 16:19:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2023-12-19 16:19:39,856 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 119 [2023-12-19 16:19:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:39,857 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2023-12-19 16:19:39,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 16:19:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2023-12-19 16:19:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 16:19:39,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:39,858 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:39,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 16:19:39,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:39,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2023-12-19 16:19:39,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:39,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638190599] [2023-12-19 16:19:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638190599] [2023-12-19 16:19:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638190599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:19:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820709149] [2023-12-19 16:19:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:39,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:19:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:39,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:19:39,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:19:39,989 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:40,043 INFO L93 Difference]: Finished difference Result 219 states and 303 transitions. [2023-12-19 16:19:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:19:40,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-19 16:19:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:40,045 INFO L225 Difference]: With dead ends: 219 [2023-12-19 16:19:40,045 INFO L226 Difference]: Without dead ends: 120 [2023-12-19 16:19:40,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:19:40,046 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 98 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:40,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 593 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:19:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-19 16:19:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-12-19 16:19:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2023-12-19 16:19:40,054 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 119 [2023-12-19 16:19:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:40,055 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2023-12-19 16:19:40,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2023-12-19 16:19:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 16:19:40,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:40,056 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 16:19:40,056 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:40,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1950694842, now seen corresponding path program 1 times [2023-12-19 16:19:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:40,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787947620] [2023-12-19 16:19:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:41,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787947620] [2023-12-19 16:19:41,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787947620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:41,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:41,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 16:19:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518834292] [2023-12-19 16:19:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:41,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 16:19:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 16:19:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:19:41,230 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 16:19:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:41,617 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2023-12-19 16:19:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:19:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-19 16:19:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:41,618 INFO L225 Difference]: With dead ends: 208 [2023-12-19 16:19:41,618 INFO L226 Difference]: Without dead ends: 105 [2023-12-19 16:19:41,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:19:41,619 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 192 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:41,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 244 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:19:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-19 16:19:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2023-12-19 16:19:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2023-12-19 16:19:41,628 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 121 [2023-12-19 16:19:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:41,629 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2023-12-19 16:19:41,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 16:19:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2023-12-19 16:19:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 16:19:41,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:41,630 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:41,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 16:19:41,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:41,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2023-12-19 16:19:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229470222] [2023-12-19 16:19:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:41,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 16:19:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229470222] [2023-12-19 16:19:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229470222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:19:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:19:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:19:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307810001] [2023-12-19 16:19:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:19:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:19:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:19:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:19:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:19:41,967 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:19:42,157 INFO L93 Difference]: Finished difference Result 243 states and 331 transitions. [2023-12-19 16:19:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:19:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-19 16:19:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:19:42,158 INFO L225 Difference]: With dead ends: 243 [2023-12-19 16:19:42,158 INFO L226 Difference]: Without dead ends: 147 [2023-12-19 16:19:42,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:19:42,159 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 273 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:19:42,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 284 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:19:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-19 16:19:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2023-12-19 16:19:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 16:19:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2023-12-19 16:19:42,169 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 121 [2023-12-19 16:19:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:19:42,170 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2023-12-19 16:19:42,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 16:19:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2023-12-19 16:19:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 16:19:42,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:19:42,171 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:19:42,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 16:19:42,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:19:42,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:19:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1514966570, now seen corresponding path program 1 times [2023-12-19 16:19:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:19:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621398950] [2023-12-19 16:19:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:19:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:19:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:19:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:19:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:19:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:19:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:19:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:19:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:19:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:19:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:19:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:19:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:19:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:19:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:19:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:19:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-19 16:19:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:19:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621398950] [2023-12-19 16:19:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621398950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:19:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476414775] [2023-12-19 16:19:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:19:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:19:43,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:19:43,622 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) [2023-12-19 16:19:43,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 16:19:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:19:43,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-19 16:19:43,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:19:44,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-19 16:19:44,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2023-12-19 16:19:44,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:44,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-19 16:19:44,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:44,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-12-19 16:19:45,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:45,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:45,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:45,122 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-12-19 16:19:45,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 62 [2023-12-19 16:19:45,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:45,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:45,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:19:45,534 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-12-19 16:19:45,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 170 [2023-12-19 16:19:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-19 16:19:45,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:19:52,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:19:52,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 246040 treesize of output 224226 [2023-12-19 16:19:53,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:19:53,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38457 treesize of output 35633 [2023-12-19 16:20:01,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4008 treesize of output 3928 [2023-12-19 16:27:20,433 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-19 16:27:20,437 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-19 16:27:20,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-19 16:27:20,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 16:27:20,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-19 16:27:20,643 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 78 more [2023-12-19 16:27:20,647 INFO L158 Benchmark]: Toolchain (without parser) took 466429.63ms. Allocated memory was 191.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 138.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-19 16:27:20,647 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 191.9MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 16:27:20,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.08ms. Allocated memory is still 191.9MB. Free memory was 138.1MB in the beginning and 123.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 16:27:20,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.01ms. Allocated memory is still 191.9MB. Free memory was 123.0MB in the beginning and 119.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 16:27:20,648 INFO L158 Benchmark]: Boogie Preprocessor took 37.51ms. Allocated memory is still 191.9MB. Free memory was 119.7MB in the beginning and 115.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 16:27:20,648 INFO L158 Benchmark]: RCFGBuilder took 448.84ms. Allocated memory is still 191.9MB. Free memory was 115.7MB in the beginning and 86.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-19 16:27:20,648 INFO L158 Benchmark]: TraceAbstraction took 465673.94ms. Allocated memory was 191.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 85.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-19 16:27:20,649 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 191.9MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.08ms. Allocated memory is still 191.9MB. Free memory was 138.1MB in the beginning and 123.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.01ms. Allocated memory is still 191.9MB. Free memory was 123.0MB in the beginning and 119.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.51ms. Allocated memory is still 191.9MB. Free memory was 119.7MB in the beginning and 115.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 448.84ms. Allocated memory is still 191.9MB. Free memory was 115.7MB in the beginning and 86.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 465673.94ms. Allocated memory was 191.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 85.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...