/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:02:11,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:02:11,389 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-21 02:02:11,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:02:11,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:02:11,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:02:11,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:02:11,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:02:11,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:02:11,421 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:02:11,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:02:11,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:02:11,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:02:11,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:02:11,423 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:02:11,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:02:11,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:02:11,423 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:02:11,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:02:11,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:02:11,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:02:11,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:02:11,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:02:11,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:02:11,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:02:11,426 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:02:11,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:02:11,427 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:02:11,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:02:11,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:02:11,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:02:11,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:02:11,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:02:11,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:02:11,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:02:11,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:02:11,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:02:11,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:02:11,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:02:11,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:02:11,430 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:02:11,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:02:11,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:02:11,431 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 -> false [2023-12-21 02:02:11,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:02:11,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:02:11,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:02:11,626 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:02:11,626 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:02:11,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2023-12-21 02:02:12,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:02:12,943 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:02:12,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2023-12-21 02:02:12,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca6513c1/7e1bd7404b3642d3a6de747b88c60993/FLAGa48af9732 [2023-12-21 02:02:12,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca6513c1/7e1bd7404b3642d3a6de747b88c60993 [2023-12-21 02:02:12,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:02:12,973 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:02:12,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:02:12,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:02:12,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:02:12,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:02:12" (1/1) ... [2023-12-21 02:02:12,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e60665d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:12, skipping insertion in model container [2023-12-21 02:02:12,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:02:12" (1/1) ... [2023-12-21 02:02:13,011 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:02:13,142 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-ap_file-62.i[917,930] [2023-12-21 02:02:13,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:02:13,213 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:02:13,225 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-ap_file-62.i[917,930] [2023-12-21 02:02:13,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:02:13,274 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:02:13,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13 WrapperNode [2023-12-21 02:02:13,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:02:13,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:02:13,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:02:13,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:02:13,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,328 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2023-12-21 02:02:13,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:02:13,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:02:13,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:02:13,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:02:13,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,362 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2023-12-21 02:02:13,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:02:13,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:02:13,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:02:13,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:02:13,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (1/1) ... [2023-12-21 02:02:13,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:02:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:02:13,454 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-21 02:02:13,484 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-21 02:02:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:02:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:02:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 02:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 02:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 02:02:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 02:02:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 02:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 02:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 02:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 02:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:02:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 02:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 02:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 02:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 02:02:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:02:13,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:02:13,618 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:02:13,620 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:02:13,962 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:02:14,027 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:02:14,027 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:02:14,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:02:14 BoogieIcfgContainer [2023-12-21 02:02:14,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:02:14,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:02:14,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:02:14,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:02:14,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:02:12" (1/3) ... [2023-12-21 02:02:14,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8ff0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:02:14, skipping insertion in model container [2023-12-21 02:02:14,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:13" (2/3) ... [2023-12-21 02:02:14,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8ff0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:02:14, skipping insertion in model container [2023-12-21 02:02:14,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:02:14" (3/3) ... [2023-12-21 02:02:14,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2023-12-21 02:02:14,051 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:02:14,051 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:02:14,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:02:14,086 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;@2d760f5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:02:14,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:02:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 02:02:14,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:14,096 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:14,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:14,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 679761065, now seen corresponding path program 1 times [2023-12-21 02:02:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:14,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495262822] [2023-12-21 02:02:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495262822] [2023-12-21 02:02:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495262822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:02:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495690723] [2023-12-21 02:02:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:14,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:02:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:14,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:02:14,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:02:14,366 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:02:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:14,414 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-21 02:02:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:02:14,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-21 02:02:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:14,440 INFO L225 Difference]: With dead ends: 129 [2023-12-21 02:02:14,440 INFO L226 Difference]: Without dead ends: 64 [2023-12-21 02:02:14,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-21 02:02:14,446 INFO L413 NwaCegarLoop]: 88 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, 88 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-21 02:02:14,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-21 02:02:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-21 02:02:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-21 02:02:14,483 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-21 02:02:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:14,483 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-21 02:02:14,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:02:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-21 02:02:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 02:02:14,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:14,485 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:14,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:02:14,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:14,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 619301017, now seen corresponding path program 1 times [2023-12-21 02:02:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013328618] [2023-12-21 02:02:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013328618] [2023-12-21 02:02:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013328618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:14,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:02:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855599557] [2023-12-21 02:02:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:14,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:02:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:14,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:02:14,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:02:14,629 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:14,664 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2023-12-21 02:02:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:02:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-21 02:02:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:14,665 INFO L225 Difference]: With dead ends: 135 [2023-12-21 02:02:14,665 INFO L226 Difference]: Without dead ends: 72 [2023-12-21 02:02:14,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:14,666 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:14,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-21 02:02:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-12-21 02:02:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2023-12-21 02:02:14,672 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2023-12-21 02:02:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:14,673 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2023-12-21 02:02:14,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2023-12-21 02:02:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 02:02:14,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:14,674 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:14,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:02:14,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:14,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash 676559319, now seen corresponding path program 1 times [2023-12-21 02:02:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383402182] [2023-12-21 02:02:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:14,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383402182] [2023-12-21 02:02:14,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383402182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:14,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:14,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:02:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312607950] [2023-12-21 02:02:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:14,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:02:14,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:14,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:02:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:02:14,840 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:14,887 INFO L93 Difference]: Finished difference Result 135 states and 192 transitions. [2023-12-21 02:02:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:02:14,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-21 02:02:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:14,890 INFO L225 Difference]: With dead ends: 135 [2023-12-21 02:02:14,890 INFO L226 Difference]: Without dead ends: 70 [2023-12-21 02:02:14,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:14,892 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:14,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-21 02:02:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-12-21 02:02:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2023-12-21 02:02:14,899 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2023-12-21 02:02:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:14,900 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2023-12-21 02:02:14,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2023-12-21 02:02:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 02:02:14,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:14,901 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:14,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:02:14,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:14,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash 676618901, now seen corresponding path program 1 times [2023-12-21 02:02:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058691500] [2023-12-21 02:02:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:15,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058691500] [2023-12-21 02:02:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058691500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:02:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280028575] [2023-12-21 02:02:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:02:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:02:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:15,274 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:15,371 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2023-12-21 02:02:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:02:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-21 02:02:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:15,373 INFO L225 Difference]: With dead ends: 144 [2023-12-21 02:02:15,373 INFO L226 Difference]: Without dead ends: 77 [2023-12-21 02:02:15,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:02:15,382 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 140 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:15,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 164 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-21 02:02:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-12-21 02:02:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 64 states have internal predecessors, (84), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 02:02:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-12-21 02:02:15,393 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 68 [2023-12-21 02:02:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:15,394 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-12-21 02:02:15,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-12-21 02:02:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-21 02:02:15,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:15,395 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:15,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:02:15,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:15,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash -707403974, now seen corresponding path program 1 times [2023-12-21 02:02:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223318541] [2023-12-21 02:02:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223318541] [2023-12-21 02:02:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223318541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:02:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291337295] [2023-12-21 02:02:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:15,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:02:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:15,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:02:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:15,603 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:15,700 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2023-12-21 02:02:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:02:15,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-21 02:02:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:15,704 INFO L225 Difference]: With dead ends: 221 [2023-12-21 02:02:15,704 INFO L226 Difference]: Without dead ends: 150 [2023-12-21 02:02:15,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:02:15,705 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 172 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:15,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 494 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-21 02:02:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 86. [2023-12-21 02:02:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 02:02:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2023-12-21 02:02:15,724 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 70 [2023-12-21 02:02:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:15,724 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2023-12-21 02:02:15,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2023-12-21 02:02:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 02:02:15,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:15,729 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:15,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:02:15,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:15,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash -746674476, now seen corresponding path program 1 times [2023-12-21 02:02:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140915726] [2023-12-21 02:02:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140915726] [2023-12-21 02:02:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140915726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427812494] [2023-12-21 02:02:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:15,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:15,909 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:15,982 INFO L93 Difference]: Finished difference Result 223 states and 305 transitions. [2023-12-21 02:02:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:15,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-21 02:02:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:15,984 INFO L225 Difference]: With dead ends: 223 [2023-12-21 02:02:15,984 INFO L226 Difference]: Without dead ends: 142 [2023-12-21 02:02:15,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:15,986 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:15,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 495 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-21 02:02:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 86. [2023-12-21 02:02:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 02:02:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2023-12-21 02:02:16,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 72 [2023-12-21 02:02:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:16,000 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2023-12-21 02:02:16,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2023-12-21 02:02:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 02:02:16,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:16,002 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:16,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:02:16,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:16,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:16,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1499775503, now seen corresponding path program 1 times [2023-12-21 02:02:16,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968875661] [2023-12-21 02:02:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968875661] [2023-12-21 02:02:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968875661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:16,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829485938] [2023-12-21 02:02:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:16,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:16,120 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:16,156 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2023-12-21 02:02:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:16,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-21 02:02:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:16,157 INFO L225 Difference]: With dead ends: 183 [2023-12-21 02:02:16,157 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 02:02:16,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:02:16,158 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:16,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 02:02:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2023-12-21 02:02:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 02:02:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2023-12-21 02:02:16,168 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 72 [2023-12-21 02:02:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:16,169 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2023-12-21 02:02:16,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2023-12-21 02:02:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 02:02:16,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:16,170 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:16,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:02:16,170 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:16,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 300332512, now seen corresponding path program 1 times [2023-12-21 02:02:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062842817] [2023-12-21 02:02:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062842817] [2023-12-21 02:02:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062842817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:16,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:16,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200456222] [2023-12-21 02:02:16,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:16,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:16,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:16,325 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:16,373 INFO L93 Difference]: Finished difference Result 204 states and 273 transitions. [2023-12-21 02:02:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:02:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-21 02:02:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:16,374 INFO L225 Difference]: With dead ends: 204 [2023-12-21 02:02:16,374 INFO L226 Difference]: Without dead ends: 120 [2023-12-21 02:02:16,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:16,374 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:16,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-21 02:02:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2023-12-21 02:02:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 77 states have internal predecessors, (99), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 02:02:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-12-21 02:02:16,380 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2023-12-21 02:02:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:16,380 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-12-21 02:02:16,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-12-21 02:02:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 02:02:16,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:16,381 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:02:16,381 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:16,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1216085754, now seen corresponding path program 1 times [2023-12-21 02:02:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:16,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798706826] [2023-12-21 02:02:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 02:02:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798706826] [2023-12-21 02:02:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798706826] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:02:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170674562] [2023-12-21 02:02:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:02:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:02:17,072 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-21 02:02:17,076 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-21 02:02:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:17,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 02:02:17,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:02:17,469 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 15 treesize of output 1 [2023-12-21 02:02:17,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:02:17,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-12-21 02:02:17,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-12-21 02:02:17,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-12-21 02:02:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 02:02:17,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:02:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2023-12-21 02:02:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170674562] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:02:17,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:02:17,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2023-12-21 02:02:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327726839] [2023-12-21 02:02:17,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 02:02:17,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 02:02:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 02:02:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2023-12-21 02:02:17,973 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-21 02:02:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:19,120 INFO L93 Difference]: Finished difference Result 322 states and 414 transitions. [2023-12-21 02:02:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 02:02:19,121 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2023-12-21 02:02:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:19,122 INFO L225 Difference]: With dead ends: 322 [2023-12-21 02:02:19,122 INFO L226 Difference]: Without dead ends: 238 [2023-12-21 02:02:19,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=1986, Unknown=0, NotChecked=0, Total=2450 [2023-12-21 02:02:19,123 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1159 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:19,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 864 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:02:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-21 02:02:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 96. [2023-12-21 02:02:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 84 states have internal predecessors, (107), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2023-12-21 02:02:19,129 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 74 [2023-12-21 02:02:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:19,129 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2023-12-21 02:02:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-21 02:02:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2023-12-21 02:02:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 02:02:19,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:19,130 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:19,136 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-21 02:02:19,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:02:19,336 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:19,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 627670330, now seen corresponding path program 1 times [2023-12-21 02:02:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:19,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381483923] [2023-12-21 02:02:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 02:02:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381483923] [2023-12-21 02:02:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381483923] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:02:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427550967] [2023-12-21 02:02:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:20,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:02:20,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:02:20,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:02:20,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 02:02:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:20,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-21 02:02:20,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:02:20,943 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-21 02:02:21,014 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 64 treesize of output 43 [2023-12-21 02:02:21,017 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 20 treesize of output 22 [2023-12-21 02:02:21,023 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 22 treesize of output 24 [2023-12-21 02:02:21,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-21 02:02:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 02:02:21,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:02:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427550967] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:02:21,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:02:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 30 [2023-12-21 02:02:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383814388] [2023-12-21 02:02:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:21,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:02:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:02:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2023-12-21 02:02:21,573 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:21,983 INFO L93 Difference]: Finished difference Result 270 states and 348 transitions. [2023-12-21 02:02:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 02:02:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 02:02:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:21,984 INFO L225 Difference]: With dead ends: 270 [2023-12-21 02:02:21,985 INFO L226 Difference]: Without dead ends: 175 [2023-12-21 02:02:21,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 02:02:21,986 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 220 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:21,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 901 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-21 02:02:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 103. [2023-12-21 02:02:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 91 states have internal predecessors, (117), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2023-12-21 02:02:21,991 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 74 [2023-12-21 02:02:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:21,991 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2023-12-21 02:02:21,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2023-12-21 02:02:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 02:02:21,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:21,992 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:21,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 02:02:22,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 02:02:22,198 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:22,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1516736159, now seen corresponding path program 1 times [2023-12-21 02:02:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157573565] [2023-12-21 02:02:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157573565] [2023-12-21 02:02:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157573565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:22,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:22,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:02:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91955168] [2023-12-21 02:02:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:22,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:02:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:02:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:22,314 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:22,373 INFO L93 Difference]: Finished difference Result 235 states and 306 transitions. [2023-12-21 02:02:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:02:22,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 02:02:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:22,375 INFO L225 Difference]: With dead ends: 235 [2023-12-21 02:02:22,375 INFO L226 Difference]: Without dead ends: 133 [2023-12-21 02:02:22,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:02:22,375 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 80 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:22,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 410 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-21 02:02:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2023-12-21 02:02:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 02:02:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2023-12-21 02:02:22,382 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 74 [2023-12-21 02:02:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:22,382 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2023-12-21 02:02:22,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2023-12-21 02:02:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 02:02:22,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:22,383 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:22,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:02:22,384 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:22,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -70320664, now seen corresponding path program 1 times [2023-12-21 02:02:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685166258] [2023-12-21 02:02:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:22,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685166258] [2023-12-21 02:02:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685166258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:22,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:22,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:02:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474308838] [2023-12-21 02:02:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:22,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:02:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:02:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:02:22,944 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:23,070 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2023-12-21 02:02:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 02:02:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:23,071 INFO L225 Difference]: With dead ends: 126 [2023-12-21 02:02:23,071 INFO L226 Difference]: Without dead ends: 124 [2023-12-21 02:02:23,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:02:23,071 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 145 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:23,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 276 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-21 02:02:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-12-21 02:02:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.25) internal successors, (130), 105 states have internal predecessors, (130), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:02:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2023-12-21 02:02:23,082 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 74 [2023-12-21 02:02:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:23,083 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2023-12-21 02:02:23,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2023-12-21 02:02:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 02:02:23,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:23,083 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:23,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:02:23,083 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:23,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -70261082, now seen corresponding path program 1 times [2023-12-21 02:02:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13804703] [2023-12-21 02:02:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13804703] [2023-12-21 02:02:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13804703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:02:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036382461] [2023-12-21 02:02:23,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:23,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:02:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:23,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:02:23,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:23,262 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:23,357 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2023-12-21 02:02:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:23,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 02:02:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:23,358 INFO L225 Difference]: With dead ends: 232 [2023-12-21 02:02:23,358 INFO L226 Difference]: Without dead ends: 123 [2023-12-21 02:02:23,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-21 02:02:23,359 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 118 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:23,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 280 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-21 02:02:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-12-21 02:02:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 105 states have internal predecessors, (129), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:02:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-12-21 02:02:23,372 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 74 [2023-12-21 02:02:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:23,372 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-12-21 02:02:23,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-12-21 02:02:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 02:02:23,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:23,373 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:23,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:02:23,373 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:23,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -13002780, now seen corresponding path program 1 times [2023-12-21 02:02:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955099912] [2023-12-21 02:02:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:24,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955099912] [2023-12-21 02:02:24,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955099912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:24,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:24,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 02:02:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862137928] [2023-12-21 02:02:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:24,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:02:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:02:24,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:02:24,026 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 02:02:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:24,348 INFO L93 Difference]: Finished difference Result 311 states and 392 transitions. [2023-12-21 02:02:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:02:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2023-12-21 02:02:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:24,351 INFO L225 Difference]: With dead ends: 311 [2023-12-21 02:02:24,351 INFO L226 Difference]: Without dead ends: 202 [2023-12-21 02:02:24,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:02:24,352 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 403 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:24,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 389 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:02:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-12-21 02:02:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 178. [2023-12-21 02:02:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 160 states have (on average 1.26875) internal successors, (203), 161 states have internal predecessors, (203), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:02:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2023-12-21 02:02:24,362 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 227 transitions. Word has length 74 [2023-12-21 02:02:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:24,362 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 227 transitions. [2023-12-21 02:02:24,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 02:02:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2023-12-21 02:02:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 02:02:24,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:24,363 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:24,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:02:24,363 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:24,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash -748214023, now seen corresponding path program 1 times [2023-12-21 02:02:24,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:24,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611099683] [2023-12-21 02:02:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611099683] [2023-12-21 02:02:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611099683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:25,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:25,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 02:02:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351017569] [2023-12-21 02:02:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:25,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 02:02:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 02:02:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:02:25,341 INFO L87 Difference]: Start difference. First operand 178 states and 227 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 02:02:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:26,254 INFO L93 Difference]: Finished difference Result 483 states and 614 transitions. [2023-12-21 02:02:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 02:02:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2023-12-21 02:02:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:26,255 INFO L225 Difference]: With dead ends: 483 [2023-12-21 02:02:26,255 INFO L226 Difference]: Without dead ends: 318 [2023-12-21 02:02:26,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2023-12-21 02:02:26,256 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 428 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:26,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 954 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:02:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-12-21 02:02:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 194. [2023-12-21 02:02:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.2529411764705882) internal successors, (213), 171 states have internal predecessors, (213), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 245 transitions. [2023-12-21 02:02:26,273 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 245 transitions. Word has length 75 [2023-12-21 02:02:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:26,273 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 245 transitions. [2023-12-21 02:02:26,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 02:02:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2023-12-21 02:02:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 02:02:26,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:26,275 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:26,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:02:26,275 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:26,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1759331273, now seen corresponding path program 1 times [2023-12-21 02:02:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414228820] [2023-12-21 02:02:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414228820] [2023-12-21 02:02:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414228820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:02:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392584888] [2023-12-21 02:02:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:26,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:02:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:02:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:02:26,429 INFO L87 Difference]: Start difference. First operand 194 states and 245 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:26,604 INFO L93 Difference]: Finished difference Result 469 states and 593 transitions. [2023-12-21 02:02:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:02:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-21 02:02:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:26,606 INFO L225 Difference]: With dead ends: 469 [2023-12-21 02:02:26,606 INFO L226 Difference]: Without dead ends: 304 [2023-12-21 02:02:26,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:02:26,606 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 226 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:26,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 407 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-21 02:02:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 194. [2023-12-21 02:02:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 171 states have internal predecessors, (211), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 243 transitions. [2023-12-21 02:02:26,623 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 243 transitions. Word has length 75 [2023-12-21 02:02:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:26,623 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 243 transitions. [2023-12-21 02:02:26,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 243 transitions. [2023-12-21 02:02:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 02:02:26,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:26,624 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:26,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:02:26,624 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:26,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -529359305, now seen corresponding path program 1 times [2023-12-21 02:02:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237420371] [2023-12-21 02:02:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:26,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237420371] [2023-12-21 02:02:26,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237420371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:26,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:26,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:02:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672483220] [2023-12-21 02:02:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:26,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:02:26,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:26,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:02:26,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:02:26,792 INFO L87 Difference]: Start difference. First operand 194 states and 243 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:26,944 INFO L93 Difference]: Finished difference Result 417 states and 522 transitions. [2023-12-21 02:02:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:02:26,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-21 02:02:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:26,947 INFO L225 Difference]: With dead ends: 417 [2023-12-21 02:02:26,947 INFO L226 Difference]: Without dead ends: 252 [2023-12-21 02:02:26,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:02:26,947 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 156 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:26,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 471 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-21 02:02:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 178. [2023-12-21 02:02:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 154 states have (on average 1.2402597402597402) internal successors, (191), 155 states have internal predecessors, (191), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2023-12-21 02:02:26,963 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 75 [2023-12-21 02:02:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:26,965 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2023-12-21 02:02:26,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2023-12-21 02:02:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 02:02:26,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:26,965 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:26,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:02:26,965 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:26,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash 663119590, now seen corresponding path program 1 times [2023-12-21 02:02:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952132195] [2023-12-21 02:02:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:27,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952132195] [2023-12-21 02:02:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952132195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:27,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:27,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:27,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477857142] [2023-12-21 02:02:27,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:27,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:27,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:27,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:27,037 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:27,135 INFO L93 Difference]: Finished difference Result 413 states and 511 transitions. [2023-12-21 02:02:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:27,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-21 02:02:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:27,137 INFO L225 Difference]: With dead ends: 413 [2023-12-21 02:02:27,137 INFO L226 Difference]: Without dead ends: 264 [2023-12-21 02:02:27,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:27,137 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 74 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:27,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 272 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-21 02:02:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2023-12-21 02:02:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 179 states have internal predecessors, (215), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2023-12-21 02:02:27,154 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 76 [2023-12-21 02:02:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:27,154 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2023-12-21 02:02:27,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2023-12-21 02:02:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 02:02:27,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:27,155 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:27,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 02:02:27,155 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:27,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1364735137, now seen corresponding path program 1 times [2023-12-21 02:02:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387735404] [2023-12-21 02:02:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387735404] [2023-12-21 02:02:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387735404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:27,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:02:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009751027] [2023-12-21 02:02:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:27,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:02:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:02:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:02:27,387 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:27,566 INFO L93 Difference]: Finished difference Result 458 states and 559 transitions. [2023-12-21 02:02:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:02:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-21 02:02:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:27,569 INFO L225 Difference]: With dead ends: 458 [2023-12-21 02:02:27,569 INFO L226 Difference]: Without dead ends: 285 [2023-12-21 02:02:27,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:02:27,570 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 203 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:27,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 245 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-21 02:02:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 259. [2023-12-21 02:02:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.2170212765957447) internal successors, (286), 236 states have internal predecessors, (286), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2023-12-21 02:02:27,587 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 76 [2023-12-21 02:02:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:27,587 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2023-12-21 02:02:27,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2023-12-21 02:02:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 02:02:27,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:27,588 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:27,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:02:27,588 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:27,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash -949896242, now seen corresponding path program 1 times [2023-12-21 02:02:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739534356] [2023-12-21 02:02:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739534356] [2023-12-21 02:02:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739534356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:02:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917620075] [2023-12-21 02:02:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:27,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:02:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:02:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:02:27,683 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:27,737 INFO L93 Difference]: Finished difference Result 431 states and 528 transitions. [2023-12-21 02:02:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:02:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-21 02:02:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:27,738 INFO L225 Difference]: With dead ends: 431 [2023-12-21 02:02:27,738 INFO L226 Difference]: Without dead ends: 201 [2023-12-21 02:02:27,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:27,741 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:27,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 214 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-21 02:02:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2023-12-21 02:02:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 177 states have (on average 1.192090395480226) internal successors, (211), 178 states have internal predecessors, (211), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2023-12-21 02:02:27,764 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 76 [2023-12-21 02:02:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:27,764 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2023-12-21 02:02:27,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2023-12-21 02:02:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 02:02:27,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:27,765 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:27,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:02:27,765 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:27,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 575098457, now seen corresponding path program 1 times [2023-12-21 02:02:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333427034] [2023-12-21 02:02:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:27,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333427034] [2023-12-21 02:02:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333427034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:27,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160174271] [2023-12-21 02:02:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:27,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:27,850 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:27,894 INFO L93 Difference]: Finished difference Result 437 states and 528 transitions. [2023-12-21 02:02:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:02:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-12-21 02:02:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:27,895 INFO L225 Difference]: With dead ends: 437 [2023-12-21 02:02:27,895 INFO L226 Difference]: Without dead ends: 265 [2023-12-21 02:02:27,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:27,896 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:27,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 297 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-21 02:02:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 201. [2023-12-21 02:02:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 178 states have internal predecessors, (209), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 241 transitions. [2023-12-21 02:02:27,910 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 241 transitions. Word has length 77 [2023-12-21 02:02:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:27,910 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 241 transitions. [2023-12-21 02:02:27,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 241 transitions. [2023-12-21 02:02:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 02:02:27,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:27,911 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:27,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:02:27,911 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:27,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -25866989, now seen corresponding path program 1 times [2023-12-21 02:02:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411357300] [2023-12-21 02:02:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411357300] [2023-12-21 02:02:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411357300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 02:02:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661725058] [2023-12-21 02:02:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:28,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 02:02:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 02:02:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:02:28,385 INFO L87 Difference]: Start difference. First operand 201 states and 241 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 02:02:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:28,718 INFO L93 Difference]: Finished difference Result 383 states and 459 transitions. [2023-12-21 02:02:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:02:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2023-12-21 02:02:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:28,719 INFO L225 Difference]: With dead ends: 383 [2023-12-21 02:02:28,719 INFO L226 Difference]: Without dead ends: 211 [2023-12-21 02:02:28,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:02:28,721 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 166 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:28,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 373 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-21 02:02:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 202. [2023-12-21 02:02:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 179 states have internal predecessors, (210), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:02:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 242 transitions. [2023-12-21 02:02:28,758 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 242 transitions. Word has length 77 [2023-12-21 02:02:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:28,758 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 242 transitions. [2023-12-21 02:02:28,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 02:02:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 242 transitions. [2023-12-21 02:02:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 02:02:28,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:28,759 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:28,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 02:02:28,759 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:28,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1674557519, now seen corresponding path program 1 times [2023-12-21 02:02:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006680539] [2023-12-21 02:02:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006680539] [2023-12-21 02:02:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006680539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:29,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:02:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606411155] [2023-12-21 02:02:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:29,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:02:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:29,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:02:29,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:02:29,005 INFO L87 Difference]: Start difference. First operand 202 states and 242 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:02:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:29,425 INFO L93 Difference]: Finished difference Result 603 states and 713 transitions. [2023-12-21 02:02:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 02:02:29,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2023-12-21 02:02:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:29,427 INFO L225 Difference]: With dead ends: 603 [2023-12-21 02:02:29,427 INFO L226 Difference]: Without dead ends: 430 [2023-12-21 02:02:29,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2023-12-21 02:02:29,428 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 371 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:29,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 650 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-12-21 02:02:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 304. [2023-12-21 02:02:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.1598513011152416) internal successors, (312), 271 states have internal predecessors, (312), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 02:02:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 356 transitions. [2023-12-21 02:02:29,451 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 356 transitions. Word has length 78 [2023-12-21 02:02:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:29,451 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 356 transitions. [2023-12-21 02:02:29,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 02:02:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 356 transitions. [2023-12-21 02:02:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 02:02:29,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:29,452 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:29,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 02:02:29,452 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:29,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1455702801, now seen corresponding path program 1 times [2023-12-21 02:02:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16188930] [2023-12-21 02:02:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:29,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:29,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16188930] [2023-12-21 02:02:29,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16188930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:29,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258109787] [2023-12-21 02:02:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:29,513 INFO L87 Difference]: Start difference. First operand 304 states and 356 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:29,610 INFO L93 Difference]: Finished difference Result 731 states and 854 transitions. [2023-12-21 02:02:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-21 02:02:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:29,612 INFO L225 Difference]: With dead ends: 731 [2023-12-21 02:02:29,612 INFO L226 Difference]: Without dead ends: 460 [2023-12-21 02:02:29,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:29,612 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 62 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:29,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 476 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:02:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-12-21 02:02:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 334. [2023-12-21 02:02:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 1.157190635451505) internal successors, (346), 301 states have internal predecessors, (346), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 02:02:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 390 transitions. [2023-12-21 02:02:29,636 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 390 transitions. Word has length 78 [2023-12-21 02:02:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:29,637 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 390 transitions. [2023-12-21 02:02:29,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 390 transitions. [2023-12-21 02:02:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-21 02:02:29,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:29,637 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:29,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 02:02:29,638 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:29,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1152528685, now seen corresponding path program 1 times [2023-12-21 02:02:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227290703] [2023-12-21 02:02:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227290703] [2023-12-21 02:02:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227290703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:29,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:29,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:29,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202820202] [2023-12-21 02:02:29,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:29,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:29,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:29,704 INFO L87 Difference]: Start difference. First operand 334 states and 390 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:29,770 INFO L93 Difference]: Finished difference Result 631 states and 734 transitions. [2023-12-21 02:02:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:02:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-12-21 02:02:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:29,772 INFO L225 Difference]: With dead ends: 631 [2023-12-21 02:02:29,772 INFO L226 Difference]: Without dead ends: 330 [2023-12-21 02:02:29,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:29,772 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:29,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 260 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-21 02:02:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 318. [2023-12-21 02:02:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.1413427561837455) internal successors, (323), 285 states have internal predecessors, (323), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 02:02:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 367 transitions. [2023-12-21 02:02:29,796 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 367 transitions. Word has length 79 [2023-12-21 02:02:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:29,796 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 367 transitions. [2023-12-21 02:02:29,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 367 transitions. [2023-12-21 02:02:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-21 02:02:29,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:02:29,797 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:02:29,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 02:02:29,797 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:02:29,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:02:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 318973285, now seen corresponding path program 1 times [2023-12-21 02:02:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:02:29,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961483286] [2023-12-21 02:02:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:02:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:02:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:02:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:02:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:02:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:02:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:02:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:02:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:02:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:02:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:02:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 02:02:29,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:02:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961483286] [2023-12-21 02:02:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961483286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:02:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:02:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:02:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585015240] [2023-12-21 02:02:29,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:02:29,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:02:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:02:29,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:02:29,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:02:29,878 INFO L87 Difference]: Start difference. First operand 318 states and 367 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:02:29,942 INFO L93 Difference]: Finished difference Result 721 states and 825 transitions. [2023-12-21 02:02:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:02:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-12-21 02:02:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:02:29,943 INFO L225 Difference]: With dead ends: 721 [2023-12-21 02:02:29,943 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 02:02:29,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:02:29,944 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 38 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:02:29,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 397 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:02:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 02:02:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 02:02:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 02:02:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 02:02:29,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2023-12-21 02:02:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:02:29,945 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 02:02:29,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 02:02:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 02:02:29,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 02:02:29,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:02:29,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-21 02:02:29,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 02:03:28,070 WARN L293 SmtUtils]: Spent 55.11s on a formula simplification. DAG size of input: 219 DAG size of output: 301 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 02:03:38,059 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-21 02:03:38,059 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-21 02:03:38,059 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-21 02:03:38,059 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-21 02:03:38,059 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (and (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset 4) (= |~#signed_char_Array_0~0.offset| 0) (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)) (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 0)) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 0)) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (<= 0 (+ 128 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) 0))) (= |~#signed_long_int_Array_0~0.offset| 0) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset 4)) (= 0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (<= 1073741822 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) 4)) (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 83) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 81) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse28 (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base))) (let ((.cse5 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse6 (select .cse28 4))) (let ((.cse0 (= |~#signed_char_Array_0~0.offset| |~#signed_long_int_Array_0~0.offset|)) (.cse1 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse2 (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse10 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (.cse7 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (.cse11 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base)) (.cse18 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse19 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse20 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse21 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse22 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse23 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (.cse3 (= |~#signed_long_int_Array_0~0.offset| 0)) (.cse4 (<= 1073741822 .cse6)) (.cse24 (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse12 (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)) (.cse25 (= |~#signed_long_int_Array_0~0.offset| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse26 (<= 0 (+ .cse5 128))) (.cse8 (let ((.cse29 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))) (<= .cse29 (+ (* (div (+ (- 1) .cse29) 256) 256) 255)))) (.cse27 (= (+ |~#signed_long_int_Array_0~0.offset| 4) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (or (let ((.cse14 (select .cse28 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse13 (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base))) (and .cse0 (or (and .cse1 .cse2 (= (select (store (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 4) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) 14) .cse3 .cse4) (and .cse1 .cse2 (<= (+ 1073741823 .cse5) .cse6) .cse7 .cse3 .cse4 .cse8)) .cse9 .cse10 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) .cse11 (= (+ ~last_1_signed_char_Array_0_2_~0 .cse12 (select .cse13 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (+ .cse14 (* 256 (div .cse12 256)))) (let ((.cse15 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (let ((.cse16 (* (div .cse15 65536) 65536)) (.cse17 (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (and (<= .cse15 (+ 32767 .cse16)) (= (+ .cse16 .cse17) .cse15)) (and (<= (+ .cse16 32768) .cse15) (= (+ 65536 .cse16 .cse17) .cse15))))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= .cse14 (select .cse13 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) .cse24 .cse25 .cse26 .cse27)) (and .cse0 .cse1 .cse9 (<= (+ .cse5 1) 0) .cse2 .cse10 .cse7 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base |~#signed_char_Array_0~0.base|) .cse4 (= (+ 128 (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1))) 0) .cse24 (= .cse12 (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) .cse25 .cse26 .cse8 .cse27))))) [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse19 (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base))) (let ((.cse0 (= |~#signed_char_Array_0~0.offset| |~#signed_long_int_Array_0~0.offset|)) (.cse1 (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse3 (let ((.cse25 (select .cse19 4))) (let ((.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse22 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse23 (= |~#signed_long_int_Array_0~0.offset| 0)) (.cse24 (<= 1073741822 .cse25))) (or (and .cse20 .cse21 .cse22 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= (select (store (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 4) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) 14) .cse23 .cse24) (and .cse20 .cse21 (<= (+ 1073741823 .cse2) .cse25) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse22 .cse23 .cse24))))) (.cse4 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (.cse5 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base)) (.cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse7 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse8 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse9 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse11 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (.cse12 (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse13 (= |~#signed_long_int_Array_0~0.offset| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse14 (<= 0 (+ .cse2 128))) (.cse15 (= (+ |~#signed_long_int_Array_0~0.offset| 4) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (or (and .cse0 .cse1 (<= (+ .cse2 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base |~#signed_char_Array_0~0.base|) (= (+ 128 (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1))) 0) .cse12 (= (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset) (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 (let ((.cse16 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (let ((.cse17 (* (div .cse16 65536) 65536)) (.cse18 (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (and (<= .cse16 (+ 32767 .cse17)) (= (+ .cse17 .cse18) .cse16)) (and (<= (+ .cse17 32768) .cse16) (= (+ 65536 .cse17 .cse18) .cse16))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select .cse19 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) .cse12 .cse13 .cse14 .cse15)))) [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-21 02:03:38,060 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 74) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L70-2(lines 70 74) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (and (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset 4) (= |~#signed_char_Array_0~0.offset| 0) (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)) (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 0)) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 0)) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (<= 0 (+ 128 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) 0))) (= |~#signed_long_int_Array_0~0.offset| 0) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset 4)) (= 0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (<= 1073741822 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) 4)) (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse19 (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base))) (let ((.cse0 (= |~#signed_char_Array_0~0.offset| |~#signed_long_int_Array_0~0.offset|)) (.cse1 (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse3 (let ((.cse25 (select .cse19 4))) (let ((.cse20 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse22 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse23 (= |~#signed_long_int_Array_0~0.offset| 0)) (.cse24 (<= 1073741822 .cse25))) (or (and .cse20 .cse21 .cse22 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= (select (store (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 4) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) 14) .cse23 .cse24) (and .cse20 .cse21 (<= (+ 1073741823 .cse2) .cse25) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse22 .cse23 .cse24))))) (.cse4 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (.cse5 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base)) (.cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse7 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse8 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse9 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse11 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) (.cse12 (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse13 (= |~#signed_long_int_Array_0~0.offset| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse14 (<= 0 (+ .cse2 128))) (.cse15 (= (+ |~#signed_long_int_Array_0~0.offset| 4) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (or (and .cse0 .cse1 (<= (+ .cse2 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base |~#signed_char_Array_0~0.base|) (= (+ 128 (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1))) 0) .cse12 (= (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset) (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 (let ((.cse16 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (let ((.cse17 (* (div .cse16 65536) 65536)) (.cse18 (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (and (<= .cse16 (+ 32767 .cse17)) (= (+ .cse17 .cse18) .cse16)) (and (<= (+ .cse17 32768) .cse16) (= (+ 65536 .cse17 .cse18) .cse16))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select .cse19 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) .cse12 .cse13 .cse14 .cse15)))) [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104-3(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104-5(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104-6(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (and (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset 4) (= |~#signed_char_Array_0~0.offset| 0) (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)) (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 0)) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 0)) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (<= 0 (+ 128 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) 0))) (= |~#signed_long_int_Array_0~0.offset| 0) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset 4)) (= 0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (<= 1073741822 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) 4)) (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104-8(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-21 02:03:38,061 INFO L899 garLoopResultBuilder]: For program point L104-9(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-10(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-11(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-12(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-14(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-16(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 67) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 55 67) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-18(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-20(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-21(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-22(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-23(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-25(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-27(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-28(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-30(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-32(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-33(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-35(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-36(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,062 INFO L899 garLoopResultBuilder]: For program point L104-38(line 104) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse15 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) 4))) (let ((.cse0 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset 4)) (.cse1 (= |~#signed_char_Array_0~0.offset| 0)) (.cse2 (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse3 (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse5 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 0))) (.cse6 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (.cse7 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (.cse8 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base)) (.cse12 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 0))) (.cse13 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse14 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse16 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse17 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse18 (<= 0 (+ 128 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) 0)))) (.cse19 (= |~#signed_long_int_Array_0~0.offset| 0)) (.cse20 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset 4))) (.cse21 (= 0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse22 (<= 1073741822 .cse15)) (.cse23 (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (let ((.cse10 (* (div .cse9 65536) 65536)) (.cse11 (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (and (<= .cse9 (+ 32767 .cse10)) (= (+ .cse10 .cse11) .cse9)) (and (<= (+ .cse10 32768) .cse9) (= (+ 65536 .cse10 .cse11) .cse9))))) .cse12 .cse13 .cse14 (= .cse15 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 (= (+ (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) 1) 128) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base |~#signed_char_Array_0~0.base|) .cse22 .cse23 (= (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset) (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))) [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse15 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) 4))) (let ((.cse0 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset 4)) (.cse1 (= |~#signed_char_Array_0~0.offset| 0)) (.cse2 (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) (.cse3 (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse5 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 0))) (.cse6 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (.cse7 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (.cse8 (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base)) (.cse12 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 0))) (.cse13 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base)) (.cse14 (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse16 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse17 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse18 (<= 0 (+ 128 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) 0)))) (.cse19 (= |~#signed_long_int_Array_0~0.offset| 0)) (.cse20 (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset 4))) (.cse21 (= 0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (.cse22 (<= 1073741822 .cse15)) (.cse23 (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) (let ((.cse10 (* (div .cse9 65536) 65536)) (.cse11 (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (and (<= .cse9 (+ 32767 .cse10)) (= (+ .cse10 .cse11) .cse9)) (and (<= (+ .cse10 32768) .cse9) (= (+ 65536 .cse10 .cse11) .cse9))))) .cse12 .cse13 .cse14 (= .cse15 (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 (= (+ (select (select |#memory_int#2| |~#signed_char_Array_0~0.base|) 1) 128) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base |~#signed_char_Array_0~0.base|) .cse22 .cse23 (= (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset) (select (select |#memory_int#5| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))) [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset 4) (= |~#signed_char_Array_0~0.offset| 0) (not (= (+ |~#unsigned_char_Array_0~0.offset| 1) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)) (<= 8 ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 0)) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= |ULTIMATE.start_updateVariables_#t~mem32#1| (select (select |#memory_int#3| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) 4)) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 0)) (= |~#signed_long_int_Array_0~0.base| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (<= 0 (+ 128 (select (select |#memory_int#2| ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) 0))) (= |~#signed_long_int_Array_0~0.offset| 0) (not (= ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset 4)) (= 0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (not (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))) [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-12-21 02:03:38,063 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 82) no Hoare annotation was computed. [2023-12-21 02:03:38,066 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:03:38,067 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:03:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset := 4][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated [2023-12-21 02:03:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated [2023-12-21 02:03:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated [2023-12-21 02:03:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-21 02:03:38,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:03:38 BoogieIcfgContainer [2023-12-21 02:03:38,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:03:38,101 INFO L158 Benchmark]: Toolchain (without parser) took 85127.93ms. Allocated memory was 316.7MB in the beginning and 669.0MB in the end (delta: 352.3MB). Free memory was 257.2MB in the beginning and 617.0MB in the end (delta: -359.8MB). Peak memory consumption was 382.6MB. Max. memory is 8.0GB. [2023-12-21 02:03:38,101 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 224.4MB. Free memory is still 174.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:03:38,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.59ms. Allocated memory is still 316.7MB. Free memory was 257.2MB in the beginning and 243.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:03:38,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.59ms. Allocated memory is still 316.7MB. Free memory was 243.2MB in the beginning and 240.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 02:03:38,101 INFO L158 Benchmark]: Boogie Preprocessor took 72.40ms. Allocated memory is still 316.7MB. Free memory was 240.4MB in the beginning and 236.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:03:38,101 INFO L158 Benchmark]: RCFGBuilder took 625.52ms. Allocated memory is still 316.7MB. Free memory was 236.9MB in the beginning and 278.0MB in the end (delta: -41.1MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. [2023-12-21 02:03:38,102 INFO L158 Benchmark]: TraceAbstraction took 84071.12ms. Allocated memory was 316.7MB in the beginning and 669.0MB in the end (delta: 352.3MB). Free memory was 277.5MB in the beginning and 617.0MB in the end (delta: -339.5MB). Peak memory consumption was 401.9MB. Max. memory is 8.0GB. [2023-12-21 02:03:38,103 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.39ms. Allocated memory is still 224.4MB. Free memory is still 174.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.59ms. Allocated memory is still 316.7MB. Free memory was 257.2MB in the beginning and 243.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.59ms. Allocated memory is still 316.7MB. Free memory was 243.2MB in the beginning and 240.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.40ms. Allocated memory is still 316.7MB. Free memory was 240.4MB in the beginning and 236.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 625.52ms. Allocated memory is still 316.7MB. Free memory was 236.9MB in the beginning and 278.0MB in the end (delta: -41.1MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. * TraceAbstraction took 84071.12ms. Allocated memory was 316.7MB in the beginning and 669.0MB in the end (delta: 352.3MB). Free memory was 277.5MB in the beginning and 617.0MB in the end (delta: -339.5MB). Peak memory consumption was 401.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset := 4][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 84.0s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 68.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4452 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4452 mSDsluCounter, 10536 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7995 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3980 IncrementalHoareTripleChecker+Invalid, 4348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 2541 mSDtfsCounter, 3980 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 979 GetRequests, 694 SyntacticMatches, 3 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=24, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 1176 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 249 PreInvPairs, 276 NumberOfFragments, 2041 HoareAnnotationTreeSize, 249 FormulaSimplifications, 1150211 FormulaSimplificationTreeSizeReduction, 63.5s HoareSimplificationTime, 10 FormulaSimplificationsInter, 448749 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2073 NumberOfCodeBlocks, 2073 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 13017 SizeOfPredicates, 31 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 3136/3248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-21 02:03:38,141 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 0 Received shutdown request...