/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 14:52:17,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 14:52:17,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 14:52:17,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 14:52:17,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 14:52:17,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 14:52:17,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 14:52:17,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 14:52:17,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 14:52:17,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 14:52:17,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 14:52:17,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 14:52:17,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 14:52:17,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 14:52:17,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 14:52:17,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 14:52:17,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 14:52:17,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 14:52:17,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 14:52:17,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 14:52:17,862 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 14:52:17,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 14:52:17,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 14:52:17,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 14:52:17,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 14:52:17,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 14:52:17,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 14:52:17,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 14:52:17,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 14:52:17,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 14:52:17,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 14:52:17,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 14:52:17,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 14:52:17,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 14:52:17,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 14:52:17,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 14:52:17,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 14:52:17,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 14:52:17,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 14:52:17,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 14:52:17,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 14:52:17,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 14:52:17,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-06 14:52:17,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 14:52:17,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 14:52:17,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 14:52:17,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 14:52:17,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 14:52:17,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 14:52:17,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 14:52:17,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 14:52:17,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 14:52:17,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 14:52:17,888 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 14:52:17,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 14:52:17,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 14:52:17,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 14:52:17,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 14:52:17,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 14:52:17,889 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-06 14:52:17,889 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-04-06 14:52:18,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 14:52:18,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 14:52:18,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 14:52:18,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 14:52:18,100 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 14:52:18,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-06 14:52:18,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954731bc6/832eca02958742fe9df3b3ff08d0728b/FLAG0df130bf5 [2022-04-06 14:52:18,551 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 14:52:18,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-06 14:52:18,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954731bc6/832eca02958742fe9df3b3ff08d0728b/FLAG0df130bf5 [2022-04-06 14:52:18,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954731bc6/832eca02958742fe9df3b3ff08d0728b [2022-04-06 14:52:18,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 14:52:18,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 14:52:18,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 14:52:18,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 14:52:18,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 14:52:18,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e92f3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18, skipping insertion in model container [2022-04-06 14:52:18,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 14:52:18,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 14:52:18,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-04-06 14:52:18,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 14:52:18,732 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 14:52:18,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-04-06 14:52:18,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 14:52:18,759 INFO L208 MainTranslator]: Completed translation [2022-04-06 14:52:18,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18 WrapperNode [2022-04-06 14:52:18,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 14:52:18,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 14:52:18,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 14:52:18,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 14:52:18,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 14:52:18,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 14:52:18,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 14:52:18,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 14:52:18,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (1/1) ... [2022-04-06 14:52:18,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 14:52:18,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 14:52:18,810 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-04-06 14:52:18,828 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-04-06 14:52:18,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 14:52:18,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 14:52:18,844 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 14:52:18,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 14:52:18,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 14:52:18,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 14:52:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 14:52:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 14:52:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 14:52:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 14:52:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 14:52:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 14:52:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-06 14:52:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 14:52:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 14:52:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 14:52:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 14:52:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 14:52:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 14:52:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 14:52:18,924 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 14:52:18,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 14:52:19,046 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 14:52:19,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 14:52:19,051 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-06 14:52:19,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 02:52:19 BoogieIcfgContainer [2022-04-06 14:52:19,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 14:52:19,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 14:52:19,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 14:52:19,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 14:52:19,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 02:52:18" (1/3) ... [2022-04-06 14:52:19,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47af34a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 02:52:19, skipping insertion in model container [2022-04-06 14:52:19,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:52:18" (2/3) ... [2022-04-06 14:52:19,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47af34a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 02:52:19, skipping insertion in model container [2022-04-06 14:52:19,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 02:52:19" (3/3) ... [2022-04-06 14:52:19,077 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-04-06 14:52:19,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 14:52:19,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 14:52:19,133 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 14:52:19,139 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-04-06 14:52:19,139 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 14:52:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 14:52:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 14:52:19,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:52:19,154 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:19,154 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 14:52:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:52:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-04-06 14:52:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:19,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4806035] [2022-04-06 14:52:19,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:52:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 2 times [2022-04-06 14:52:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:52:19,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11123127] [2022-04-06 14:52:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:52:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:52:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:52:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:52:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:52:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11123127] [2022-04-06 14:52:19,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11123127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:19,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:19,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 14:52:19,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:52:19,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4806035] [2022-04-06 14:52:19,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4806035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:19,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:19,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 14:52:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276948305] [2022-04-06 14:52:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:52:19,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 14:52:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:19,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 14:52:19,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 14:52:19,372 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-04-06 14:52:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:52:19,421 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-06 14:52:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 14:52:19,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-06 14:52:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:52:19,427 INFO L225 Difference]: With dead ends: 40 [2022-04-06 14:52:19,427 INFO L226 Difference]: Without dead ends: 17 [2022-04-06 14:52:19,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 14:52:19,433 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 14:52:19,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 14:52:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-06 14:52:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-06 14:52:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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-04-06 14:52:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-06 14:52:19,463 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-06 14:52:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:52:19,463 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-06 14:52:19,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-04-06 14:52:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-06 14:52:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 14:52:19,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:52:19,465 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:19,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 14:52:19,467 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 14:52:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:52:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-04-06 14:52:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:19,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961766105] [2022-04-06 14:52:19,470 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:52:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 2 times [2022-04-06 14:52:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:52:19,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591008878] [2022-04-06 14:52:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:52:19,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:52:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:52:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:52:19,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:52:19,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591008878] [2022-04-06 14:52:19,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591008878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:19,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:19,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 14:52:19,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:52:19,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961766105] [2022-04-06 14:52:19,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961766105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:19,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:19,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 14:52:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907262045] [2022-04-06 14:52:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:52:19,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 14:52:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 14:52:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:52:19,978 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 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-04-06 14:52:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:52:20,181 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-06 14:52:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 14:52:20,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 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 16 [2022-04-06 14:52:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:52:20,183 INFO L225 Difference]: With dead ends: 33 [2022-04-06 14:52:20,184 INFO L226 Difference]: Without dead ends: 28 [2022-04-06 14:52:20,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-06 14:52:20,185 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:52:20,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:52:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-06 14:52:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-06 14:52:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 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-04-06 14:52:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-06 14:52:20,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-06 14:52:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:52:20,192 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-06 14:52:20,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 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-04-06 14:52:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-06 14:52:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 14:52:20,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:52:20,193 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:20,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 14:52:20,193 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 14:52:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:52:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-04-06 14:52:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:20,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722099644] [2022-04-06 14:52:20,312 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-06 14:52:20,312 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-06 14:52:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash 605837905, now seen corresponding path program 1 times [2022-04-06 14:52:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:52:20,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882659800] [2022-04-06 14:52:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:52:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:52:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:21,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:52:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:52:21,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:52:21,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882659800] [2022-04-06 14:52:21,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882659800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:21,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:21,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-06 14:52:21,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:52:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722099644] [2022-04-06 14:52:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722099644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:21,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:21,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 14:52:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742186812] [2022-04-06 14:52:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:52:21,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 14:52:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 14:52:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-06 14:52:21,926 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 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-04-06 14:52:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:52:22,176 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-06 14:52:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:52:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 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 17 [2022-04-06 14:52:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:52:22,176 INFO L225 Difference]: With dead ends: 30 [2022-04-06 14:52:22,177 INFO L226 Difference]: Without dead ends: 18 [2022-04-06 14:52:22,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-04-06 14:52:22,178 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:52:22,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 33 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:52:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-06 14:52:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-06 14:52:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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-04-06 14:52:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-06 14:52:22,181 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2022-04-06 14:52:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:52:22,181 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-06 14:52:22,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 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-04-06 14:52:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-06 14:52:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 14:52:22,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:52:22,182 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:22,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 14:52:22,182 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 14:52:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:52:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 1 times [2022-04-06 14:52:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:22,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550792916] [2022-04-06 14:52:22,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-06 14:52:22,227 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-06 14:52:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1095867821, now seen corresponding path program 1 times [2022-04-06 14:52:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:52:22,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362187828] [2022-04-06 14:52:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:52:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:52:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:52:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:52:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:52:23,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362187828] [2022-04-06 14:52:23,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362187828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:23,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:23,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 14:52:24,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:52:24,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550792916] [2022-04-06 14:52:24,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550792916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:24,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:24,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-06 14:52:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982980355] [2022-04-06 14:52:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:52:24,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-06 14:52:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-06 14:52:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-06 14:52:24,054 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 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-04-06 14:52:26,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-06 14:52:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:52:26,864 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-06 14:52:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 14:52:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 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 17 [2022-04-06 14:52:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:52:26,872 INFO L225 Difference]: With dead ends: 28 [2022-04-06 14:52:26,872 INFO L226 Difference]: Without dead ends: 23 [2022-04-06 14:52:26,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-06 14:52:26,873 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:52:26,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 14:52:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-06 14:52:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-06 14:52:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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-04-06 14:52:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-06 14:52:26,878 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-06 14:52:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:52:26,878 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-06 14:52:26,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 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-04-06 14:52:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-06 14:52:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 14:52:26,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:52:26,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:26,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 14:52:26,879 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 14:52:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:52:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 275689641, now seen corresponding path program 1 times [2022-04-06 14:52:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:26,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831461483] [2022-04-06 14:52:26,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-06 14:52:26,942 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-06 14:52:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 730368584, now seen corresponding path program 1 times [2022-04-06 14:52:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:52:26,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817370921] [2022-04-06 14:52:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:52:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:52:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:52:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:52:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:52:27,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817370921] [2022-04-06 14:52:27,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817370921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:27,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:27,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:52:27,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:52:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831461483] [2022-04-06 14:52:27,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831461483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:27,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:27,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:52:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022929487] [2022-04-06 14:52:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:52:27,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:52:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:52:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:52:27,062 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-04-06 14:52:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:52:27,143 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-06 14:52:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:52:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-06 14:52:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:52:27,144 INFO L225 Difference]: With dead ends: 27 [2022-04-06 14:52:27,144 INFO L226 Difference]: Without dead ends: 19 [2022-04-06 14:52:27,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:52:27,145 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 14:52:27,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 14:52:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-06 14:52:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-06 14:52:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 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-04-06 14:52:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-06 14:52:27,150 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2022-04-06 14:52:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:52:27,150 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-06 14:52:27,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-04-06 14:52:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-06 14:52:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 14:52:27,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:52:27,151 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:27,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 14:52:27,151 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 14:52:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:52:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374134, now seen corresponding path program 1 times [2022-04-06 14:52:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:27,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2007191217] [2022-04-06 14:52:27,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-06 14:52:27,223 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-06 14:52:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1058657623, now seen corresponding path program 1 times [2022-04-06 14:52:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:52:27,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286605540] [2022-04-06 14:52:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:52:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:52:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:52:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:52:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:52:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:52:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286605540] [2022-04-06 14:52:27,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286605540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:27,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 14:52:27,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:52:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2007191217] [2022-04-06 14:52:27,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2007191217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:52:27,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:52:27,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 14:52:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575631742] [2022-04-06 14:52:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:52:27,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 14:52:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:52:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 14:52:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-06 14:52:27,741 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 3 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-04-06 14:52:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:52:28,035 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-06 14:52:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:52:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 3 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 18 [2022-04-06 14:52:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:52:28,035 INFO L225 Difference]: With dead ends: 19 [2022-04-06 14:52:28,035 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 14:52:28,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-04-06 14:52:28,036 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 14:52:28,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 14:52:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 14:52:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 14:52:28,037 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-04-06 14:52:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 14:52:28,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-06 14:52:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:52:28,037 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 14:52:28,037 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 3 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-04-06 14:52:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 14:52:28,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 14:52:28,039 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 14:52:28,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 14:52:28,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 14:52:28,549 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-06 14:52:28,549 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-06 14:52:28,549 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-06 14:52:28,549 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-06 14:52:28,550 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-06 14:52:28,550 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-06 14:52:28,550 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-06 14:52:28,550 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 29 31) the Hoare annotation is: (let ((.cse5 (div main_~i~0 4294967296))) (let ((.cse0 (div main_~n~0 4294967296)) (.cse1 (* ~SIZE~0 3)) (.cse2 (= (+ main_~j~0 (* .cse5 4294967296)) main_~i~0)) (.cse4 (= main_~k~0 main_~j~0))) (or (let ((.cse3 (* .cse0 4294967296))) (and (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse0 (- 4294967296))) (- 4294967296)) 8589934592) 60000003) .cse1) .cse2 (or (< 1 main_~i~0) (= main_~i~0 1)) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse3)) (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 .cse3)) .cse4)) (and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 .cse5)) (+ (* .cse0 8589934592) (* main_~i~0 2) .cse1)) .cse2 (= main_~i~0 0) .cse4) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))))) [2022-04-06 14:52:28,550 INFO L878 garLoopResultBuilder]: At program point L29-3(lines 29 31) the Hoare annotation is: (let ((.cse1 (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (.cse2 (= main_~k~0 main_~j~0))) (or (let ((.cse0 (div main_~n~0 4294967296))) (and (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse0 (- 4294967296))) (- 4294967296)) 8589934592) 60000003) (* ~SIZE~0 3)) .cse1 (or (< 1 main_~i~0) (= main_~i~0 1)) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* .cse0 4294967296))) .cse2)) (and .cse1 (= main_~i~0 0) .cse2) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)))) [2022-04-06 14:52:28,550 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 34) the Hoare annotation is: true [2022-04-06 14:52:28,550 INFO L878 garLoopResultBuilder]: At program point L25-2(lines 25 27) the Hoare annotation is: (or (let ((.cse2 (div main_~n~0 4294967296)) (.cse3 (div main_~i~0 4294967296))) (let ((.cse1 (* .cse3 4294967296)) (.cse0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse2 (- 4294967296))) (- 4294967296)) 4294967296))) (and (<= (+ main_~n~0 .cse0 .cse1) (+ main_~i~0 (* .cse2 4294967296))) (= (+ main_~j~0 .cse1) main_~i~0) (not (<= (+ .cse3 1) 0)) (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse0))))) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-06 14:52:28,550 INFO L878 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (let ((.cse0 (div main_~i~0 4294967296))) (let ((.cse2 (* ~SIZE~0 3)) (.cse3 (= (+ main_~j~0 (* .cse0 4294967296)) main_~i~0)) (.cse1 (div main_~n~0 4294967296))) (or (not (<= 20000001 ~SIZE~0)) (and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 .cse0)) (+ (* .cse1 8589934592) (* main_~i~0 2) .cse2)) .cse3 (= main_~i~0 0)) (let ((.cse4 (* .cse1 4294967296))) (and (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse1 (- 4294967296))) (- 4294967296)) 8589934592) 60000003) .cse2) .cse3 (or (< 1 main_~i~0) (= main_~i~0 1)) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse4)) (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 .cse4)))) (not (<= ~SIZE~0 20000001))))) [2022-04-06 14:52:28,551 INFO L885 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: true [2022-04-06 14:52:28,551 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (let ((.cse0 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))) (or (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (mod main_~n~0 4294967296))) (and .cse0 (or (and (< 1 main_~i~0) (<= (div (+ (* (- 1) main_~i~0) .cse1 1) (- 4294967296)) 0)) (= main_~i~0 1)) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse1))) (not (<= ~SIZE~0 20000001)) (and .cse0 (= main_~i~0 0)))) [2022-04-06 14:52:28,551 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (let ((.cse2 (div main_~n~0 4294967296))) (let ((.cse1 (div main_~i~0 4294967296)) (.cse0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse2 (- 4294967296))) (- 4294967296)) 4294967296))) (and (<= (+ main_~n~0 .cse0 (* .cse1 4294967296)) (+ main_~i~0 (* .cse2 4294967296))) (not (<= (+ .cse1 1) 0)) (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse0)))))) [2022-04-06 14:52:28,551 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 34) the Hoare annotation is: true [2022-04-06 14:52:28,551 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-06 14:52:28,551 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 34) the Hoare annotation is: true [2022-04-06 14:52:28,551 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-06 14:52:28,551 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 14:52:28,551 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-06 14:52:28,551 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 14:52:28,552 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-06 14:52:28,552 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 14:52:28,552 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 14:52:28,552 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-06 14:52:28,552 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2022-04-06 14:52:28,552 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-04-06 14:52:28,552 INFO L878 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0))) [2022-04-06 14:52:28,552 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-04-06 14:52:28,552 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2022-04-06 14:52:28,554 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:52:28,555 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 14:52:28,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 02:52:28 BoogieIcfgContainer [2022-04-06 14:52:28,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 14:52:28,566 INFO L158 Benchmark]: Toolchain (without parser) took 9994.11ms. Allocated memory was 161.5MB in the beginning and 246.4MB in the end (delta: 84.9MB). Free memory was 110.5MB in the beginning and 84.3MB in the end (delta: 26.2MB). Peak memory consumption was 110.4MB. Max. memory is 8.0GB. [2022-04-06 14:52:28,566 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 14:52:28,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.60ms. Allocated memory is still 161.5MB. Free memory was 110.3MB in the beginning and 137.5MB in the end (delta: -27.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 14:52:28,567 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 161.5MB. Free memory was 137.5MB in the beginning and 136.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 14:52:28,567 INFO L158 Benchmark]: RCFGBuilder took 266.84ms. Allocated memory is still 161.5MB. Free memory was 136.3MB in the beginning and 126.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 14:52:28,567 INFO L158 Benchmark]: TraceAbstraction took 9504.93ms. Allocated memory was 161.5MB in the beginning and 246.4MB in the end (delta: 84.9MB). Free memory was 125.8MB in the beginning and 84.3MB in the end (delta: 41.5MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. [2022-04-06 14:52:28,568 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.10ms. Allocated memory is still 161.5MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.60ms. Allocated memory is still 161.5MB. Free memory was 110.3MB in the beginning and 137.5MB in the end (delta: -27.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 161.5MB. Free memory was 137.5MB in the beginning and 136.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.84ms. Allocated memory is still 161.5MB. Free memory was 136.3MB in the beginning and 126.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9504.93ms. Allocated memory was 161.5MB in the beginning and 246.4MB in the end (delta: 84.9MB). Free memory was 125.8MB in the beginning and 84.3MB in the end (delta: 41.5MB). Peak memory consumption was 127.4MB. 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: 10]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 72 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 80 NumberOfFragments, 616 HoareAnnotationTreeSize, 54 FomulaSimplifications, 41 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 435 FormulaSimplificationTreeSizeReductionInter, 0.5s 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: 21]: Loop Invariant Derived loop invariant: ((!(20000001 <= SIZE) || ((n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296 && ((1 < i && (-1 * i + n % 4294967296 + 1) / -4294967296 <= 0) || i == 1)) && (i + 4294967295) % 4294967296 < n % 4294967296)) || !(SIZE <= 20000001)) || (n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296 && i == 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((-1 * i + n + n / 4294967296 * -4294967296) / -4294967296 * 8589934592 + 60000003 <= SIZE * 3 && j + i / 4294967296 * 4294967296 == i) && (1 < i || i == 1)) && n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296) && n + 4294967296 * (j / 4294967296) <= j + n / 4294967296 * 4294967296) && k == j) || (((n * 2 + 60000003 + 8589934592 * (i / 4294967296) <= n / 4294967296 * 8589934592 + i * 2 + SIZE * 3 && j + i / 4294967296 * 4294967296 == i) && i == 0) && k == j)) || !(20000001 <= SIZE)) || !(SIZE <= 20000001) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((n + (-1 * i + n + n / 4294967296 * -4294967296) / -4294967296 * 4294967296 + i / 4294967296 * 4294967296 <= i + n / 4294967296 * 4294967296 && j + i / 4294967296 * 4294967296 == i) && !(i / 4294967296 + 1 <= 0)) && i + SIZE / 4294967296 * 4294967296 <= 20000001 + (-1 * i + n + n / 4294967296 * -4294967296) / -4294967296 * 4294967296) || !(20000001 <= SIZE)) || !(SIZE <= 20000001) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-06 14:52:28,596 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...