/usr/bin/java -ea -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/sum_array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:43:48,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:43:48,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:43:48,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:43:48,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:43:48,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:43:48,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:43:48,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:43:48,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:43:48,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:43:48,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:43:48,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:43:48,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:43:48,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:43:48,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:43:48,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:43:48,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:43:48,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:43:48,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:43:48,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:43:48,760 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:43:48,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:43:48,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:43:48,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:43:48,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:43:48,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:43:48,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:43:48,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:43:48,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:43:48,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:43:48,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:43:48,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:43:48,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:43:48,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:43:48,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:43:48,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:43:48,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:43:48,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:43:48,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:43:48,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:43:48,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:43:48,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:43:48,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:43:48,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:43:48,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:43:48,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:43:48,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:43:48,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:43:48,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:43:48,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:43:48,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:43:48,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:43:48,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:43:48,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:43:48,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:43:48,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:43:48,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:43:48,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:43:48,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:43:48,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:43:48,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:43:48,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:43:48,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:43:48,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:43:48,798 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:43:48,798 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:43:48,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:43:48,799 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:43:48,799 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-15 05:43:49,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:43:49,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:43:49,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:43:49,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:43:49,034 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:43:49,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-1.c [2022-04-15 05:43:49,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6378d53c4/b41475c7411a42e688ab6e6b6c44200f/FLAG0741cf888 [2022-04-15 05:43:49,501 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:43:49,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-1.c [2022-04-15 05:43:49,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6378d53c4/b41475c7411a42e688ab6e6b6c44200f/FLAG0741cf888 [2022-04-15 05:43:49,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6378d53c4/b41475c7411a42e688ab6e6b6c44200f [2022-04-15 05:43:49,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:43:49,523 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:43:49,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:43:49,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:43:49,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:43:49,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70571d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49, skipping insertion in model container [2022-04-15 05:43:49,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:43:49,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:43:49,696 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/sum_array-1.c[363,376] [2022-04-15 05:43:49,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:43:49,731 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:43:49,742 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/sum_array-1.c[363,376] [2022-04-15 05:43:49,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:43:49,761 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:43:49,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49 WrapperNode [2022-04-15 05:43:49,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:43:49,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:43:49,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:43:49,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:43:49,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:43:49,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:43:49,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:43:49,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:43:49,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (1/1) ... [2022-04-15 05:43:49,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:43:49,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:49,833 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-15 05:43:49,856 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-15 05:43:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:43:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:43:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:43:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:43:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:43:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:43:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:43:49,930 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:43:49,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:43:50,133 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:43:50,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:43:50,139 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 05:43:50,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:43:50 BoogieIcfgContainer [2022-04-15 05:43:50,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:43:50,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:43:50,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:43:50,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:43:50,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:43:49" (1/3) ... [2022-04-15 05:43:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697889c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:43:50, skipping insertion in model container [2022-04-15 05:43:50,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:49" (2/3) ... [2022-04-15 05:43:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697889c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:43:50, skipping insertion in model container [2022-04-15 05:43:50,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:43:50" (3/3) ... [2022-04-15 05:43:50,148 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-1.c [2022-04-15 05:43:50,152 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:43:50,152 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:43:50,220 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:43:50,226 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-15 05:43:50,226 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:43:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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-15 05:43:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:43:50,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:50,253 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:50,254 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 955945954, now seen corresponding path program 1 times [2022-04-15 05:43:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:50,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [435295167] [2022-04-15 05:43:50,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:43:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 955945954, now seen corresponding path program 2 times [2022-04-15 05:43:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671863364] [2022-04-15 05:43:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:50,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-15 05:43:50,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 05:43:50,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #81#return; {33#true} is VALID [2022-04-15 05:43:50,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:50,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-15 05:43:50,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 05:43:50,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #81#return; {33#true} is VALID [2022-04-15 05:43:50,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret16 := main(); {33#true} is VALID [2022-04-15 05:43:50,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} ~M~0 := #t~nondet4;havoc #t~nondet4;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {38#(= main_~i~0 0)} is VALID [2022-04-15 05:43:50,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 05:43:50,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 05:43:50,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 05:43:50,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 05:43:50,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 05:43:50,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {40#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:43:50,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem15 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem14 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {34#false} is VALID [2022-04-15 05:43:50,678 INFO L272 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem15 == #t~mem13 - #t~mem14 then 1 else 0)); {34#false} is VALID [2022-04-15 05:43:50,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 05:43:50,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 05:43:50,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 05:43:50,681 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-15 05:43:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:50,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671863364] [2022-04-15 05:43:50,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671863364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:50,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:50,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:50,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:50,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [435295167] [2022-04-15 05:43:50,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [435295167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:50,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:50,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787571630] [2022-04-15 05:43:50,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 05:43:50,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:50,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 05:43:50,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:50,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:43:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:43:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:43:50,756 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 05:43:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:51,278 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-15 05:43:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:43:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 05:43:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 05:43:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-15 05:43:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 05:43:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-15 05:43:51,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-04-15 05:43:51,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:51,422 INFO L225 Difference]: With dead ends: 71 [2022-04-15 05:43:51,422 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 05:43:51,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:43:51,428 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:51,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 35 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:43:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 05:43:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-15 05:43:51,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:51,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:51,461 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:51,461 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:51,466 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 05:43:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 05:43:51,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:51,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:51,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 05:43:51,468 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 05:43:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:51,472 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 05:43:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 05:43:51,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:51,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:51,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:51,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-15 05:43:51,476 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2022-04-15 05:43:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:51,477 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-15 05:43:51,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 05:43:51,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-15 05:43:51,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 05:43:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:43:51,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:51,515 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:51,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:43:51,516 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1073067556, now seen corresponding path program 1 times [2022-04-15 05:43:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:51,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525262702] [2022-04-15 05:43:51,548 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:51,548 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:51,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1073067556, now seen corresponding path program 2 times [2022-04-15 05:43:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:51,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170918260] [2022-04-15 05:43:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:43:51,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:43:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:43:51,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:43:51,727 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 05:43:51,727 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 05:43:51,730 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:43:51,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:43:51,735 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-15 05:43:51,738 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:43:51,749 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-15 05:43:51,750 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-15 05:43:51,751 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:43:51,752 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:43:51,753 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:43:51,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:43:51 BoogieIcfgContainer [2022-04-15 05:43:51,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:43:51,756 INFO L158 Benchmark]: Toolchain (without parser) took 2232.63ms. Allocated memory was 180.4MB in the beginning and 288.4MB in the end (delta: 108.0MB). Free memory was 125.2MB in the beginning and 220.4MB in the end (delta: -95.1MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-15 05:43:51,756 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory was 141.6MB in the beginning and 141.5MB in the end (delta: 148.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:43:51,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.92ms. Allocated memory is still 180.4MB. Free memory was 125.1MB in the beginning and 155.8MB in the end (delta: -30.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-15 05:43:51,757 INFO L158 Benchmark]: Boogie Preprocessor took 30.54ms. Allocated memory is still 180.4MB. Free memory was 155.8MB in the beginning and 154.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:43:51,757 INFO L158 Benchmark]: RCFGBuilder took 347.15ms. Allocated memory is still 180.4MB. Free memory was 153.9MB in the beginning and 139.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 05:43:51,758 INFO L158 Benchmark]: TraceAbstraction took 1612.21ms. Allocated memory was 180.4MB in the beginning and 288.4MB in the end (delta: 108.0MB). Free memory was 138.7MB in the beginning and 220.4MB in the end (delta: -81.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-15 05:43:51,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory was 141.6MB in the beginning and 141.5MB in the end (delta: 148.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.92ms. Allocated memory is still 180.4MB. Free memory was 125.1MB in the beginning and 155.8MB in the end (delta: -30.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.54ms. Allocated memory is still 180.4MB. Free memory was 155.8MB in the beginning and 154.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 347.15ms. Allocated memory is still 180.4MB. Free memory was 153.9MB in the beginning and 139.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1612.21ms. Allocated memory was 180.4MB in the beginning and 288.4MB in the end (delta: 108.0MB). Free memory was 138.7MB in the beginning and 220.4MB in the end (delta: -81.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int M = __VERIFIER_nondet_uint(); [L17] int A[M], B[M], C[M]; [L18] unsigned int i; [L20] i=0 [L20] COND TRUE i