/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 18:13:41,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 18:13:41,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 18:13:41,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 18:13:41,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 18:13:41,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 18:13:41,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 18:13:41,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 18:13:41,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 18:13:41,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 18:13:41,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 18:13:41,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 18:13:41,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 18:13:41,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 18:13:41,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 18:13:41,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 18:13:41,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 18:13:41,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 18:13:41,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 18:13:41,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 18:13:41,633 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 18:13:41,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 18:13:41,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 18:13:41,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 18:13:41,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 18:13:41,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 18:13:41,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 18:13:41,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 18:13:41,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 18:13:41,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 18:13:41,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 18:13:41,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 18:13:41,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 18:13:41,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 18:13:41,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 18:13:41,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 18:13:41,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 18:13:41,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 18:13:41,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 18:13:41,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 18:13:41,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 18:13:41,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 18:13:41,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 18:13:41,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 18:13:41,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 18:13:41,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 18:13:41,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 18:13:41,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 18:13:41,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 18:13:41,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 18:13:41,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 18:13:41,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 18:13:41,660 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 18:13:41,660 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 18:13:41,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 18:13:41,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 18:13:41,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 18:13:41,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 18:13:41,966 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 18:13:41,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-03-20 18:13:42,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f3bd22a/265ce1668d0a49a996be73421b134a65/FLAG2a450a055 [2022-03-20 18:13:42,506 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 18:13:42,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-03-20 18:13:42,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f3bd22a/265ce1668d0a49a996be73421b134a65/FLAG2a450a055 [2022-03-20 18:13:42,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f3bd22a/265ce1668d0a49a996be73421b134a65 [2022-03-20 18:13:42,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 18:13:42,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 18:13:42,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 18:13:42,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 18:13:42,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 18:13:42,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:13:42" (1/1) ... [2022-03-20 18:13:42,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402faf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:42, skipping insertion in model container [2022-03-20 18:13:42,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:13:42" (1/1) ... [2022-03-20 18:13:42,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 18:13:42,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 18:13:43,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2022-03-20 18:13:43,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 18:13:43,129 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 18:13:43,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2022-03-20 18:13:43,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 18:13:43,167 INFO L208 MainTranslator]: Completed translation [2022-03-20 18:13:43,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43 WrapperNode [2022-03-20 18:13:43,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 18:13:43,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 18:13:43,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 18:13:43,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 18:13:43,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 18:13:43,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 18:13:43,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 18:13:43,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 18:13:43,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (1/1) ... [2022-03-20 18:13:43,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 18:13:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 18:13:43,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 18:13:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 18:13:43,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 18:13:43,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 18:13:43,301 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 18:13:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 18:13:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 18:13:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 18:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 18:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 18:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-20 18:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-20 18:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 18:13:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 18:13:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 18:13:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 18:13:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 18:13:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 18:13:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 18:13:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 18:13:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 18:13:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 18:13:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 18:13:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 18:13:43,372 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 18:13:43,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 18:13:43,591 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 18:13:43,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 18:13:43,626 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 18:13:43,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:13:43 BoogieIcfgContainer [2022-03-20 18:13:43,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 18:13:43,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 18:13:43,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 18:13:43,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 18:13:43,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 06:13:42" (1/3) ... [2022-03-20 18:13:43,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2f70a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:13:43, skipping insertion in model container [2022-03-20 18:13:43,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:13:43" (2/3) ... [2022-03-20 18:13:43,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2f70a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:13:43, skipping insertion in model container [2022-03-20 18:13:43,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:13:43" (3/3) ... [2022-03-20 18:13:43,636 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-03-20 18:13:43,656 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 18:13:43,656 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 18:13:43,712 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 18:13:43,719 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-03-20 18:13:43,720 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 18:13:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-20 18:13:43,754 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:43,754 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:43,755 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2022-03-20 18:13:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786600095] [2022-03-20 18:13:43,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 2 times [2022-03-20 18:13:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:43,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676570093] [2022-03-20 18:13:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:43,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 18:13:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676570093] [2022-03-20 18:13:44,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676570093] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:44,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:44,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:44,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:44,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786600095] [2022-03-20 18:13:44,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786600095] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:44,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:44,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545023423] [2022-03-20 18:13:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:44,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 18:13:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:44,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 18:13:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 18:13:44,138 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:13:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:44,543 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2022-03-20 18:13:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 18:13:44,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-03-20 18:13:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:44,561 INFO L225 Difference]: With dead ends: 88 [2022-03-20 18:13:44,561 INFO L226 Difference]: Without dead ends: 47 [2022-03-20 18:13:44,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 18:13:44,570 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:44,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 18:13:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-20 18:13:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-03-20 18:13:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-03-20 18:13:44,673 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-03-20 18:13:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:44,674 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-03-20 18:13:44,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:13:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-03-20 18:13:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-20 18:13:44,677 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:44,677 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:44,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 18:13:44,678 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2022-03-20 18:13:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:44,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666425764] [2022-03-20 18:13:44,679 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 2 times [2022-03-20 18:13:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:44,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357326175] [2022-03-20 18:13:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 18:13:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357326175] [2022-03-20 18:13:44,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357326175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:44,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:44,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:44,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:44,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666425764] [2022-03-20 18:13:44,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666425764] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:44,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:44,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680917625] [2022-03-20 18:13:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:44,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 18:13:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 18:13:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 18:13:44,773 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:13:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:44,986 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-03-20 18:13:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 18:13:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-03-20 18:13:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:44,993 INFO L225 Difference]: With dead ends: 55 [2022-03-20 18:13:44,993 INFO L226 Difference]: Without dead ends: 53 [2022-03-20 18:13:44,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 18:13:44,999 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:45,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:13:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-20 18:13:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-03-20 18:13:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-03-20 18:13:45,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-03-20 18:13:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:45,026 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-03-20 18:13:45,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:13:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-03-20 18:13:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 18:13:45,028 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:45,028 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:45,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 18:13:45,028 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2022-03-20 18:13:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081388329] [2022-03-20 18:13:45,034 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 2 times [2022-03-20 18:13:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:45,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206256516] [2022-03-20 18:13:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 18:13:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 18:13:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:45,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206256516] [2022-03-20 18:13:45,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206256516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:45,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:45,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:45,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:45,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081388329] [2022-03-20 18:13:45,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081388329] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:45,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:45,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400951123] [2022-03-20 18:13:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:45,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 18:13:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 18:13:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 18:13:45,125 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 18:13:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:45,337 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-03-20 18:13:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 18:13:45,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-03-20 18:13:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:45,339 INFO L225 Difference]: With dead ends: 57 [2022-03-20 18:13:45,339 INFO L226 Difference]: Without dead ends: 55 [2022-03-20 18:13:45,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 18:13:45,341 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:45,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:13:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-20 18:13:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-03-20 18:13:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-03-20 18:13:45,353 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-03-20 18:13:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:45,354 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-03-20 18:13:45,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 18:13:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-03-20 18:13:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 18:13:45,355 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:45,355 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:45,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 18:13:45,355 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2022-03-20 18:13:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [16696336] [2022-03-20 18:13:45,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 2 times [2022-03-20 18:13:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295574079] [2022-03-20 18:13:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 18:13:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 18:13:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 18:13:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:45,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295574079] [2022-03-20 18:13:45,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295574079] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:45,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:45,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:13:45,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:45,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [16696336] [2022-03-20 18:13:45,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [16696336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:45,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:45,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:13:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611965579] [2022-03-20 18:13:45,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:45,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 18:13:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 18:13:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-20 18:13:45,435 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 18:13:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:45,662 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-03-20 18:13:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 18:13:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-03-20 18:13:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:45,663 INFO L225 Difference]: With dead ends: 61 [2022-03-20 18:13:45,663 INFO L226 Difference]: Without dead ends: 59 [2022-03-20 18:13:45,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 18:13:45,665 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:45,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 18:13:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-20 18:13:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-03-20 18:13:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-03-20 18:13:45,677 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-03-20 18:13:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:45,678 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-03-20 18:13:45,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 18:13:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-03-20 18:13:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-20 18:13:45,679 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:45,679 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:45,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 18:13:45,680 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2022-03-20 18:13:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514857726] [2022-03-20 18:13:45,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 2 times [2022-03-20 18:13:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:45,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308115549] [2022-03-20 18:13:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:45,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 18:13:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 18:13:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 18:13:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 18:13:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308115549] [2022-03-20 18:13:45,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308115549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:45,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:45,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:45,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514857726] [2022-03-20 18:13:45,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514857726] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:13:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708932222] [2022-03-20 18:13:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:45,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 18:13:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 18:13:45,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 18:13:45,769 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 18:13:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:45,942 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-03-20 18:13:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 18:13:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-03-20 18:13:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:45,944 INFO L225 Difference]: With dead ends: 66 [2022-03-20 18:13:45,944 INFO L226 Difference]: Without dead ends: 64 [2022-03-20 18:13:45,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 18:13:45,945 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:45,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:13:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-20 18:13:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-03-20 18:13:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-03-20 18:13:45,957 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-03-20 18:13:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:45,957 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-03-20 18:13:45,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 18:13:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-03-20 18:13:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 18:13:45,959 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:45,959 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:45,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 18:13:45,959 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2022-03-20 18:13:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129314690] [2022-03-20 18:13:45,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 2 times [2022-03-20 18:13:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:45,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732059020] [2022-03-20 18:13:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 18:13:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 18:13:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 18:13:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 18:13:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 18:13:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-03-20 18:13:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 18:13:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732059020] [2022-03-20 18:13:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732059020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:46,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:13:46,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:46,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129314690] [2022-03-20 18:13:46,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129314690] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:46,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:13:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442877056] [2022-03-20 18:13:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:46,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 18:13:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:46,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 18:13:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-20 18:13:46,078 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 18:13:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:46,321 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-03-20 18:13:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 18:13:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-03-20 18:13:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:46,323 INFO L225 Difference]: With dead ends: 75 [2022-03-20 18:13:46,323 INFO L226 Difference]: Without dead ends: 73 [2022-03-20 18:13:46,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 18:13:46,326 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:46,326 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 18:13:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-20 18:13:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-03-20 18:13:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-03-20 18:13:46,353 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-03-20 18:13:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:46,355 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-03-20 18:13:46,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 18:13:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-03-20 18:13:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 18:13:46,362 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:46,362 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:46,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 18:13:46,363 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2022-03-20 18:13:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:46,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815960174] [2022-03-20 18:13:46,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 2 times [2022-03-20 18:13:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:46,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945461151] [2022-03-20 18:13:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 18:13:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 18:13:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 18:13:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 18:13:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 18:13:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-03-20 18:13:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-20 18:13:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-03-20 18:13:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-20 18:13:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:46,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945461151] [2022-03-20 18:13:46,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945461151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:46,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:46,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 18:13:46,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815960174] [2022-03-20 18:13:46,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815960174] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:46,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:46,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 18:13:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878770065] [2022-03-20 18:13:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:46,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 18:13:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 18:13:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-20 18:13:46,556 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 18:13:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:46,823 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-03-20 18:13:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 18:13:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-03-20 18:13:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:46,826 INFO L225 Difference]: With dead ends: 75 [2022-03-20 18:13:46,826 INFO L226 Difference]: Without dead ends: 73 [2022-03-20 18:13:46,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-03-20 18:13:46,829 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:46,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 18:13:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-20 18:13:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-03-20 18:13:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 18:13:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-03-20 18:13:46,863 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-03-20 18:13:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:46,863 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-03-20 18:13:46,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 18:13:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-03-20 18:13:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 18:13:46,865 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:13:46,865 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:13:46,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 18:13:46,865 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:13:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:13:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2022-03-20 18:13:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:46,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734857541] [2022-03-20 18:13:46,867 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:13:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 2 times [2022-03-20 18:13:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:13:46,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362079348] [2022-03-20 18:13:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:13:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:13:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:13:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 18:13:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 18:13:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 18:13:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 18:13:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 18:13:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-03-20 18:13:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-20 18:13:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-03-20 18:13:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-20 18:13:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-03-20 18:13:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:13:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-03-20 18:13:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:13:47,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362079348] [2022-03-20 18:13:47,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362079348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:47,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:47,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 18:13:47,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:13:47,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734857541] [2022-03-20 18:13:47,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734857541] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:13:47,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:13:47,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 18:13:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037985169] [2022-03-20 18:13:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:13:47,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 18:13:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:13:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 18:13:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-03-20 18:13:47,018 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-03-20 18:13:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:13:47,270 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-03-20 18:13:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 18:13:47,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-03-20 18:13:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:13:47,271 INFO L225 Difference]: With dead ends: 73 [2022-03-20 18:13:47,271 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 18:13:47,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-20 18:13:47,272 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 18:13:47,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 61 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 18:13:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 18:13:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 18:13:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 18:13:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 18:13:47,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-03-20 18:13:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:13:47,274 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 18:13:47,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-03-20 18:13:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 18:13:47,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 18:13:47,277 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 18:13:47,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 18:13:47,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-03-20 18:13:47,741 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-03-20 18:13:47,742 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,742 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-03-20 18:13:47,742 INFO L878 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,742 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2022-03-20 18:13:47,742 INFO L878 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,742 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,742 INFO L878 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L36(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,743 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,744 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,744 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,744 INFO L885 garLoopResultBuilder]: At program point L34-3(lines 34 65) the Hoare annotation is: true [2022-03-20 18:13:47,745 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2022-03-20 18:13:47,745 INFO L878 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,745 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-03-20 18:13:47,745 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,745 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-03-20 18:13:47,745 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 18:13:47,745 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 18:13:47,745 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 18:13:47,745 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 18:13:47,745 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 18:13:47,745 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 18:13:47,746 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 18:13:47,746 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-03-20 18:13:47,746 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-03-20 18:13:47,746 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-03-20 18:13:47,746 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-20 18:13:47,746 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-20 18:13:47,746 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-03-20 18:13:47,749 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-03-20 18:13:47,751 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 18:13:47,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 06:13:47 BoogieIcfgContainer [2022-03-20 18:13:47,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 18:13:47,767 INFO L158 Benchmark]: Toolchain (without parser) took 4879.97ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 120.5MB in the beginning and 69.1MB in the end (delta: 51.4MB). Peak memory consumption was 85.8MB. Max. memory is 8.0GB. [2022-03-20 18:13:47,768 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 137.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 18:13:47,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.33ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 147.9MB in the end (delta: -27.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 18:13:47,768 INFO L158 Benchmark]: Boogie Preprocessor took 44.87ms. Allocated memory is still 172.0MB. Free memory was 147.9MB in the beginning and 146.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 18:13:47,768 INFO L158 Benchmark]: RCFGBuilder took 412.70ms. Allocated memory is still 172.0MB. Free memory was 146.2MB in the beginning and 134.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 18:13:47,769 INFO L158 Benchmark]: TraceAbstraction took 4137.84ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 134.2MB in the beginning and 69.1MB in the end (delta: 65.1MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. [2022-03-20 18:13:47,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 137.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.33ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 147.9MB in the end (delta: -27.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.87ms. Allocated memory is still 172.0MB. Free memory was 147.9MB in the beginning and 146.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 412.70ms. Allocated memory is still 172.0MB. Free memory was 146.2MB in the beginning and 134.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4137.84ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 134.2MB in the beginning and 69.1MB in the end (delta: 65.1MB). Peak memory consumption was 100.7MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1482 IncrementalHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 294 mSDtfsCounter, 1482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 235 PreInvPairs, 302 NumberOfFragments, 561 HoareAnnotationTreeSize, 235 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 43 FomulaSimplificationsInter, 581 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-03-20 18:13:47,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...