/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-sp_file-25.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:31:17,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:31:17,729 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-16 04:31:17,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:31:17,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:31:17,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:31:17,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:31:17,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:31:17,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:31:17,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:31:17,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:31:17,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:31:17,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:31:17,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:31:17,780 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:31:17,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:31:17,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:31:17,781 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:31:17,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:31:17,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:31:17,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:31:17,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:31:17,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:31:17,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:31:17,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:31:17,782 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:31:17,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:31:17,782 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:31:17,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:31:17,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:31:17,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:31:17,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:31:17,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:31:17,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:31:17,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:31:17,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:31:17,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:31:17,785 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-16 04:31:18,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:31:18,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:31:18,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:31:18,048 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:31:18,048 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:31:18,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2023-12-16 04:31:19,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:31:19,433 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:31:19,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2023-12-16 04:31:19,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54b7b191/e18a5e9280ef4070818ff3fe9a452f53/FLAGc3175275c [2023-12-16 04:31:19,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54b7b191/e18a5e9280ef4070818ff3fe9a452f53 [2023-12-16 04:31:19,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:31:19,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:31:19,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:31:19,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:31:19,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:31:19,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:19,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5389d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19, skipping insertion in model container [2023-12-16 04:31:19,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:19,561 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:31:19,697 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i[917,930] [2023-12-16 04:31:19,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:31:19,818 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:31:19,830 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i[917,930] [2023-12-16 04:31:19,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:31:19,963 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:31:19,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19 WrapperNode [2023-12-16 04:31:19,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:31:19,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:31:19,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:31:19,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:31:19,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,048 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 566 [2023-12-16 04:31:20,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:31:20,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:31:20,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:31:20,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:31:20,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,074 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 19 writes are split as follows [0, 19]. [2023-12-16 04:31:20,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:31:20,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:31:20,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:31:20,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:31:20,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (1/1) ... [2023-12-16 04:31:20,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:31:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:20,157 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-16 04:31:20,213 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-16 04:31:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:31:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:31:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:31:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:31:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:31:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:31:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:31:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:31:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:31:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:31:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:31:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:31:20,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:31:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:31:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:31:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:31:20,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:31:20,383 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:31:20,385 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:31:20,865 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:31:20,900 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:31:20,900 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:31:20,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:31:20 BoogieIcfgContainer [2023-12-16 04:31:20,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:31:20,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:31:20,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:31:20,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:31:20,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:31:19" (1/3) ... [2023-12-16 04:31:20,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c45e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:31:20, skipping insertion in model container [2023-12-16 04:31:20,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:19" (2/3) ... [2023-12-16 04:31:20,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c45e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:31:20, skipping insertion in model container [2023-12-16 04:31:20,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:31:20" (3/3) ... [2023-12-16 04:31:20,908 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-25.i [2023-12-16 04:31:20,920 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:31:20,920 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:31:20,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:31:20,977 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;@293f99ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:31:20,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:31:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 97 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:31:21,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:21,000 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:21,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:21,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash -140249938, now seen corresponding path program 1 times [2023-12-16 04:31:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92518058] [2023-12-16 04:31:21,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92518058] [2023-12-16 04:31:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92518058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:31:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135874657] [2023-12-16 04:31:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:21,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:31:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:21,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:31:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:31:21,535 INFO L87 Difference]: Start difference. First operand has 117 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 97 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:21,591 INFO L93 Difference]: Finished difference Result 231 states and 368 transitions. [2023-12-16 04:31:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:31:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2023-12-16 04:31:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:21,603 INFO L225 Difference]: With dead ends: 231 [2023-12-16 04:31:21,603 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 04:31:21,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-16 04:31:21,608 INFO L413 NwaCegarLoop]: 167 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, 167 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-16 04:31:21,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 04:31:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-16 04:31:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2023-12-16 04:31:21,746 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 139 [2023-12-16 04:31:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:21,747 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2023-12-16 04:31:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2023-12-16 04:31:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:31:21,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:21,756 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:21,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:31:21,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:21,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1033622798, now seen corresponding path program 1 times [2023-12-16 04:31:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211759370] [2023-12-16 04:31:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:23,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:23,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211759370] [2023-12-16 04:31:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211759370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:23,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:31:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025770308] [2023-12-16 04:31:23,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:23,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:31:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:31:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:31:23,813 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:24,502 INFO L93 Difference]: Finished difference Result 312 states and 465 transitions. [2023-12-16 04:31:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:31:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2023-12-16 04:31:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:24,504 INFO L225 Difference]: With dead ends: 312 [2023-12-16 04:31:24,504 INFO L226 Difference]: Without dead ends: 198 [2023-12-16 04:31:24,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:31:24,505 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 420 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:24,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 663 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:31:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-16 04:31:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2023-12-16 04:31:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2023-12-16 04:31:24,517 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 139 [2023-12-16 04:31:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:24,518 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-12-16 04:31:24,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2023-12-16 04:31:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:31:24,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:24,519 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:24,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:31:24,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:24,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 555964663, now seen corresponding path program 1 times [2023-12-16 04:31:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976919018] [2023-12-16 04:31:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976919018] [2023-12-16 04:31:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976919018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:25,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:31:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661930733] [2023-12-16 04:31:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:25,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:31:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:25,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:31:25,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:31:25,039 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:25,391 INFO L93 Difference]: Finished difference Result 348 states and 519 transitions. [2023-12-16 04:31:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:31:25,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-16 04:31:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:25,393 INFO L225 Difference]: With dead ends: 348 [2023-12-16 04:31:25,393 INFO L226 Difference]: Without dead ends: 216 [2023-12-16 04:31:25,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:31:25,394 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 346 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:25,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 634 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:31:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-16 04:31:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 149. [2023-12-16 04:31:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 129 states have (on average 1.441860465116279) internal successors, (186), 129 states have internal predecessors, (186), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2023-12-16 04:31:25,405 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 140 [2023-12-16 04:31:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:25,405 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2023-12-16 04:31:25,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2023-12-16 04:31:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:31:25,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:25,407 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:25,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:31:25,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:25,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash 441949948, now seen corresponding path program 1 times [2023-12-16 04:31:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:25,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382841541] [2023-12-16 04:31:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:25,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:25,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:25,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382841541] [2023-12-16 04:31:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382841541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:25,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:31:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321224010] [2023-12-16 04:31:25,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:25,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:31:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:31:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:25,561 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:25,606 INFO L93 Difference]: Finished difference Result 327 states and 488 transitions. [2023-12-16 04:31:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:31:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-16 04:31:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:25,608 INFO L225 Difference]: With dead ends: 327 [2023-12-16 04:31:25,608 INFO L226 Difference]: Without dead ends: 179 [2023-12-16 04:31:25,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-16 04:31:25,615 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 93 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:25,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 714 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-16 04:31:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2023-12-16 04:31:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2023-12-16 04:31:25,633 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 141 [2023-12-16 04:31:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:25,634 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2023-12-16 04:31:25,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2023-12-16 04:31:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-16 04:31:25,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:25,635 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:25,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:31:25,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:25,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash 753777650, now seen corresponding path program 1 times [2023-12-16 04:31:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854855956] [2023-12-16 04:31:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854855956] [2023-12-16 04:31:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854855956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:26,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:26,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:31:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304685680] [2023-12-16 04:31:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:26,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:31:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:31:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:31:26,405 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:26,908 INFO L93 Difference]: Finished difference Result 369 states and 546 transitions. [2023-12-16 04:31:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:31:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-16 04:31:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:26,911 INFO L225 Difference]: With dead ends: 369 [2023-12-16 04:31:26,911 INFO L226 Difference]: Without dead ends: 220 [2023-12-16 04:31:26,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:31:26,912 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 339 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:26,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 626 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:31:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-16 04:31:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 134. [2023-12-16 04:31:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 198 transitions. [2023-12-16 04:31:26,937 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 198 transitions. Word has length 142 [2023-12-16 04:31:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:26,938 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 198 transitions. [2023-12-16 04:31:26,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 198 transitions. [2023-12-16 04:31:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:31:26,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:26,939 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:26,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:31:26,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:26,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1752248407, now seen corresponding path program 1 times [2023-12-16 04:31:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821949534] [2023-12-16 04:31:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:27,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:27,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821949534] [2023-12-16 04:31:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821949534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:31:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823453852] [2023-12-16 04:31:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:27,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:31:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:27,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:31:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:31:27,737 INFO L87 Difference]: Start difference. First operand 134 states and 198 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:28,119 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2023-12-16 04:31:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:31:28,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2023-12-16 04:31:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:28,121 INFO L225 Difference]: With dead ends: 301 [2023-12-16 04:31:28,121 INFO L226 Difference]: Without dead ends: 168 [2023-12-16 04:31:28,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:31:28,121 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 473 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:28,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 422 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:31:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-16 04:31:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2023-12-16 04:31:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:31:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2023-12-16 04:31:28,131 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 143 [2023-12-16 04:31:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:28,132 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2023-12-16 04:31:28,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2023-12-16 04:31:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:31:28,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:28,133 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:28,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:31:28,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:28,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 928492247, now seen corresponding path program 1 times [2023-12-16 04:31:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097850932] [2023-12-16 04:31:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 04:31:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097850932] [2023-12-16 04:31:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097850932] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:31:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378933243] [2023-12-16 04:31:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:28,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:31:28,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:28,544 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-16 04:31:28,572 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-16 04:31:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 04:31:28,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:31:29,463 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-16 04:31:29,814 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-16 04:31:29,814 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 1 case distinctions, treesize of input 25 treesize of output 20 [2023-12-16 04:31:29,897 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-12-16 04:31:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:31:29,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:31:30,630 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 52 treesize of output 44 [2023-12-16 04:31:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 04:31:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378933243] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:31:30,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:31:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-12-16 04:31:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247702019] [2023-12-16 04:31:30,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:31:30,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 04:31:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:30,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 04:31:30,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:31:30,768 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 7 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 5 states have call predecessors, (37), 7 states have call successors, (37) [2023-12-16 04:31:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:31,622 INFO L93 Difference]: Finished difference Result 329 states and 482 transitions. [2023-12-16 04:31:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:31:31,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 7 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 5 states have call predecessors, (37), 7 states have call successors, (37) Word has length 143 [2023-12-16 04:31:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:31,625 INFO L225 Difference]: With dead ends: 329 [2023-12-16 04:31:31,625 INFO L226 Difference]: Without dead ends: 196 [2023-12-16 04:31:31,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 307 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2023-12-16 04:31:31,627 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 351 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:31,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 793 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:31:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-16 04:31:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 182. [2023-12-16 04:31:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 145 states have (on average 1.3655172413793104) internal successors, (198), 146 states have internal predecessors, (198), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:31:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2023-12-16 04:31:31,651 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 143 [2023-12-16 04:31:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:31,651 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2023-12-16 04:31:31,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 7 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 5 states have call predecessors, (37), 7 states have call successors, (37) [2023-12-16 04:31:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2023-12-16 04:31:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 04:31:31,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:31,653 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:31,663 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-16 04:31:31,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:31:31,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:31,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1934792640, now seen corresponding path program 1 times [2023-12-16 04:31:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785378629] [2023-12-16 04:31:31,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785378629] [2023-12-16 04:31:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785378629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:32,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:32,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:31:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607190278] [2023-12-16 04:31:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:32,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:31:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:31:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:31:32,834 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:33,482 INFO L93 Difference]: Finished difference Result 402 states and 585 transitions. [2023-12-16 04:31:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:31:33,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-12-16 04:31:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:33,485 INFO L225 Difference]: With dead ends: 402 [2023-12-16 04:31:33,486 INFO L226 Difference]: Without dead ends: 263 [2023-12-16 04:31:33,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:31:33,487 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 402 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:33,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 544 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:31:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-12-16 04:31:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 199. [2023-12-16 04:31:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.376543209876543) internal successors, (223), 163 states have internal predecessors, (223), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:31:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2023-12-16 04:31:33,513 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 144 [2023-12-16 04:31:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:33,513 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2023-12-16 04:31:33,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2023-12-16 04:31:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:31:33,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:33,514 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:33,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:31:33,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:33,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -51575493, now seen corresponding path program 1 times [2023-12-16 04:31:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575576978] [2023-12-16 04:31:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575576978] [2023-12-16 04:31:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575576978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:38,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:38,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-16 04:31:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941628063] [2023-12-16 04:31:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:38,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 04:31:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 04:31:38,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:31:38,996 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:31:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:44,332 INFO L93 Difference]: Finished difference Result 500 states and 730 transitions. [2023-12-16 04:31:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 04:31:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2023-12-16 04:31:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:44,341 INFO L225 Difference]: With dead ends: 500 [2023-12-16 04:31:44,341 INFO L226 Difference]: Without dead ends: 344 [2023-12-16 04:31:44,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=332, Invalid=1228, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 04:31:44,343 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1067 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:44,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1815 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-16 04:31:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-12-16 04:31:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 219. [2023-12-16 04:31:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.39010989010989) internal successors, (253), 183 states have internal predecessors, (253), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:31:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 321 transitions. [2023-12-16 04:31:44,367 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 321 transitions. Word has length 146 [2023-12-16 04:31:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:44,369 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 321 transitions. [2023-12-16 04:31:44,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:31:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 321 transitions. [2023-12-16 04:31:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:31:44,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:44,371 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:44,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:31:44,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:44,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash 206589945, now seen corresponding path program 1 times [2023-12-16 04:31:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966875168] [2023-12-16 04:31:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966875168] [2023-12-16 04:31:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966875168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:31:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755448085] [2023-12-16 04:31:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:46,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:31:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:31:46,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:31:46,373 INFO L87 Difference]: Start difference. First operand 219 states and 321 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:47,550 INFO L93 Difference]: Finished difference Result 491 states and 716 transitions. [2023-12-16 04:31:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:31:47,550 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-12-16 04:31:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:47,552 INFO L225 Difference]: With dead ends: 491 [2023-12-16 04:31:47,552 INFO L226 Difference]: Without dead ends: 315 [2023-12-16 04:31:47,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:31:47,553 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 457 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:47,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 787 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:31:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-12-16 04:31:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 219. [2023-12-16 04:31:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 183 states have internal predecessors, (252), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:31:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2023-12-16 04:31:47,647 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 146 [2023-12-16 04:31:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:47,647 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2023-12-16 04:31:47,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:31:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2023-12-16 04:31:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:31:47,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:47,648 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:47,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:31:47,648 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:47,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 10464121, now seen corresponding path program 1 times [2023-12-16 04:31:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403439999] [2023-12-16 04:31:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:49,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:49,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403439999] [2023-12-16 04:31:49,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403439999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:49,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:49,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:31:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545353204] [2023-12-16 04:31:49,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:49,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:31:49,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:31:49,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:31:49,634 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:51,191 INFO L93 Difference]: Finished difference Result 457 states and 665 transitions. [2023-12-16 04:31:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:31:51,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2023-12-16 04:31:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:51,194 INFO L225 Difference]: With dead ends: 457 [2023-12-16 04:31:51,194 INFO L226 Difference]: Without dead ends: 281 [2023-12-16 04:31:51,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:31:51,195 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 554 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:51,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 759 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:31:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-16 04:31:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 219. [2023-12-16 04:31:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.379120879120879) internal successors, (251), 183 states have internal predecessors, (251), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:31:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 319 transitions. [2023-12-16 04:31:51,236 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 319 transitions. Word has length 146 [2023-12-16 04:31:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:51,254 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 319 transitions. [2023-12-16 04:31:51,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:31:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 319 transitions. [2023-12-16 04:31:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:31:51,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:51,256 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:31:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:31:51,256 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:51,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 268629559, now seen corresponding path program 1 times [2023-12-16 04:31:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211690702] [2023-12-16 04:31:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:31:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:31:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:31:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:31:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:31:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:31:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:31:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211690702] [2023-12-16 04:31:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211690702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:56,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:56,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-16 04:31:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402654506] [2023-12-16 04:31:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:56,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 04:31:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 04:31:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:31:56,057 INFO L87 Difference]: Start difference. First operand 219 states and 319 transitions. Second operand has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:32:02,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:32:06,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:32:10,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:32:14,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:32:18,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:32:22,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-16 04:32:26,031 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:32:26,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:32:27,232 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 04:32:27,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 04:32:27,239 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 290 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 48 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:32:27,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 634 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1063 Invalid, 7 Unknown, 0 Unchecked, 29.0s Time] [2023-12-16 04:32:27,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:32:27,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:32:27,240 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-16 04:32:27,243 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:32:27,254 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:32:27,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:32:27 BoogieIcfgContainer [2023-12-16 04:32:27,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:32:27,267 INFO L158 Benchmark]: Toolchain (without parser) took 67765.14ms. Allocated memory was 246.4MB in the beginning and 842.0MB in the end (delta: 595.6MB). Free memory was 179.3MB in the beginning and 406.7MB in the end (delta: -227.4MB). Peak memory consumption was 369.7MB. Max. memory is 8.0GB. [2023-12-16 04:32:27,267 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 246.4MB. Free memory is still 195.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:32:27,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.84ms. Allocated memory was 246.4MB in the beginning and 462.4MB in the end (delta: 216.0MB). Free memory was 179.1MB in the beginning and 425.0MB in the end (delta: -245.9MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2023-12-16 04:32:27,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.99ms. Allocated memory is still 462.4MB. Free memory was 425.0MB in the beginning and 420.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:32:27,268 INFO L158 Benchmark]: Boogie Preprocessor took 49.65ms. Allocated memory is still 462.4MB. Free memory was 420.8MB in the beginning and 416.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:32:27,268 INFO L158 Benchmark]: RCFGBuilder took 801.55ms. Allocated memory is still 462.4MB. Free memory was 416.1MB in the beginning and 380.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-16 04:32:27,268 INFO L158 Benchmark]: TraceAbstraction took 66363.41ms. Allocated memory was 462.4MB in the beginning and 842.0MB in the end (delta: 379.6MB). Free memory was 379.9MB in the beginning and 406.7MB in the end (delta: -26.8MB). Peak memory consumption was 353.3MB. Max. memory is 8.0GB. [2023-12-16 04:32:27,271 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.10ms. Allocated memory is still 246.4MB. Free memory is still 195.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 459.84ms. Allocated memory was 246.4MB in the beginning and 462.4MB in the end (delta: 216.0MB). Free memory was 179.1MB in the beginning and 425.0MB in the end (delta: -245.9MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.99ms. Allocated memory is still 462.4MB. Free memory was 425.0MB in the beginning and 420.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.65ms. Allocated memory is still 462.4MB. Free memory was 420.8MB in the beginning and 416.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 801.55ms. Allocated memory is still 462.4MB. Free memory was 416.1MB in the beginning and 380.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 66363.41ms. Allocated memory was 462.4MB in the beginning and 842.0MB in the end (delta: 379.6MB). Free memory was 379.9MB in the beginning and 406.7MB in the end (delta: -26.8MB). Peak memory consumption was 353.3MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.3s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 42.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 4794 SdHoareTripleChecker+Valid, 35.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4792 mSDsluCounter, 8558 SdHoareTripleChecker+Invalid, 34.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6629 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7366 IncrementalHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 1929 mSDtfsCounter, 7366 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 960 GetRequests, 755 SyntacticMatches, 16 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=9, InterpolantAutomatonStates: 107, 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, 11 MinimizatonAttempts, 642 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 1858 NumberOfCodeBlocks, 1858 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1987 ConstructedInterpolants, 0 QuantifiedInterpolants, 32647 SizeOfPredicates, 10 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 8431/8568 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown