/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invariants/eq2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:32:56,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:32:56,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:32:56,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:32:56,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:32:56,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:32:56,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:32:56,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:32:56,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:32:56,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:32:56,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:32:56,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:32:56,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:32:56,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:32:56,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:32:56,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:32:56,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:32:56,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:32:56,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:32:56,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:32:56,732 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:32:56,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:32:56,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:32:56,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:32:56,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:32:56,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:32:56,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:32:56,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:32:56,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:32:56,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:32:56,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:32:56,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:32:56,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:32:56,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:32:56,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:32:56,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:32:56,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:32:56,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:32:56,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:32:56,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:32:56,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:32:56,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:32:56,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:32:56,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:32:56,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:32:56,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:32:56,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:32:56,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:32:56,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:32:56,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:32:56,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:32:56,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:32:56,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:32:56,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:32:56,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:32:56,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:32:56,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:32:56,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:32:56,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:32:56,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:32:56,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:32:56,771 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:32:56,771 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:32:56,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:32:56,771 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:32:56,771 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-28 10:32:56,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:32:56,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:32:56,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:32:56,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:32:56,995 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:32:56,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/eq2.c [2022-04-28 10:32:57,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf585ac8/7fce95c81b9a44bfa744b0344aea0400/FLAG1d1b0d400 [2022-04-28 10:32:57,416 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:32:57,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq2.c [2022-04-28 10:32:57,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf585ac8/7fce95c81b9a44bfa744b0344aea0400/FLAG1d1b0d400 [2022-04-28 10:32:57,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf585ac8/7fce95c81b9a44bfa744b0344aea0400 [2022-04-28 10:32:57,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:32:57,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:32:57,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:32:57,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:32:57,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:32:57,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4719fa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57, skipping insertion in model container [2022-04-28 10:32:57,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:32:57,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:32:57,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq2.c[364,377] [2022-04-28 10:32:57,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:32:57,604 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:32:57,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq2.c[364,377] [2022-04-28 10:32:57,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:32:57,636 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:32:57,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57 WrapperNode [2022-04-28 10:32:57,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:32:57,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:32:57,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:32:57,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:32:57,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:32:57,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:32:57,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:32:57,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:32:57,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (1/1) ... [2022-04-28 10:32:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:32:57,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:32:57,692 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-28 10:32:57,698 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-28 10:32:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:32:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:32:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:32:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:32:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:32:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:32:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:32:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:32:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:32:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:32:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:32:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:32:57,777 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:32:57,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:32:57,933 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:32:57,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:32:57,938 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:32:57,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:32:57 BoogieIcfgContainer [2022-04-28 10:32:57,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:32:57,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:32:57,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:32:57,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:32:57,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:32:57" (1/3) ... [2022-04-28 10:32:57,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f7e0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:32:57, skipping insertion in model container [2022-04-28 10:32:57,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:32:57" (2/3) ... [2022-04-28 10:32:57,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f7e0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:32:57, skipping insertion in model container [2022-04-28 10:32:57,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:32:57" (3/3) ... [2022-04-28 10:32:57,973 INFO L111 eAbstractionObserver]: Analyzing ICFG eq2.c [2022-04-28 10:32:57,983 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:32:57,984 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:32:58,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:32:58,045 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f5a11e5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@375e8dfa [2022-04-28 10:32:58,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:32:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-28 10:32:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:32:58,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:32:58,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:32:58,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:32:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:32:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash 130651299, now seen corresponding path program 1 times [2022-04-28 10:32:58,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:58,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613612706] [2022-04-28 10:32:58,082 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:32:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 130651299, now seen corresponding path program 2 times [2022-04-28 10:32:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:32:58,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223035239] [2022-04-28 10:32:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:32:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:32:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:32:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:58,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(6, 2);call write~init~int(101, 2, 0, 1);call write~init~int(113, 2, 1, 1);call write~init~int(50, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 10:32:58,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 10:32:58,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2022-04-28 10:32:58,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:32:58,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(6, 2);call write~init~int(101, 2, 0, 1);call write~init~int(113, 2, 1, 1);call write~init~int(50, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 10:32:58,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 10:32:58,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2022-04-28 10:32:58,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret8 := main(); {22#true} is VALID [2022-04-28 10:32:58,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~w~0;~y~0 := 1 + ~w~0;~z~0 := 1 + ~x~0; {27#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-28 10:32:58,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} assume !(0 != #t~nondet5 % 4294967296);havoc #t~nondet5; {27#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-28 10:32:58,511 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~z~0 % 4294967296 then 1 else 0)); {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:32:58,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:32:58,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23#false} is VALID [2022-04-28 10:32:58,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 10:32:58,514 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-28 10:32:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:32:58,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223035239] [2022-04-28 10:32:58,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223035239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:32:58,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:32:58,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:32:58,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:32:58,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613612706] [2022-04-28 10:32:58,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613612706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:32:58,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:32:58,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:32:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289667396] [2022-04-28 10:32:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:32:58,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-28 10:32:58,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:32:58,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 10:32:58,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:58,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:32:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:32:58,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:32:58,568 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 10:32:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:58,807 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 10:32:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:32:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-28 10:32:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:32:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 10:32:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 10:32:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 10:32:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 10:32:58,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 10:32:58,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:58,852 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:32:58,852 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:32:58,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:32:58,867 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:32:58,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:32:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:32:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:32:58,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:32:58,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-28 10:32:58,883 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-28 10:32:58,883 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-28 10:32:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:58,883 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:32:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:32:58,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:58,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:58,884 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-28 10:32:58,884 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-28 10:32:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:58,884 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:32:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:32:58,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:58,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:58,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:32:58,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:32:58,885 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-28 10:32:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:32:58,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-28 10:32:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:32:58,886 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:32:58,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 10:32:58,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:32:58,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:32:58,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:58,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:32:58,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:32:58,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:32:58,974 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:32:58,974 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:32:58,974 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:32:58,974 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 11 22) the Hoare annotation is: true [2022-04-28 10:32:58,975 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 11 22) the Hoare annotation is: (let ((.cse1 (* (div main_~z~0 4294967296) 4294967296)) (.cse0 (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0))) (and (< .cse0 (+ main_~y~0 .cse1 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 .cse1) .cse0))) [2022-04-28 10:32:58,975 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse1 (* (div main_~z~0 4294967296) 4294967296)) (.cse0 (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0))) (and (< .cse0 (+ main_~y~0 .cse1 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 .cse1) .cse0))) [2022-04-28 10:32:58,975 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 19) the Hoare annotation is: (let ((.cse1 (* (div main_~z~0 4294967296) 4294967296)) (.cse0 (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0))) (and (< .cse0 (+ main_~y~0 .cse1 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 .cse1) .cse0))) [2022-04-28 10:32:58,975 INFO L895 garLoopResultBuilder]: At program point L16-3(lines 16 19) the Hoare annotation is: (let ((.cse1 (* (div main_~z~0 4294967296) 4294967296)) (.cse0 (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0))) (and (< .cse0 (+ main_~y~0 .cse1 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 .cse1) .cse0))) [2022-04-28 10:32:58,975 INFO L895 garLoopResultBuilder]: At program point mainFINAL(lines 11 22) the Hoare annotation is: (let ((.cse1 (* (div main_~z~0 4294967296) 4294967296)) (.cse0 (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0))) (and (< .cse0 (+ main_~y~0 .cse1 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 .cse1) .cse0))) [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 10:32:58,976 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:32:58,976 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:32:58,977 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:32:58,977 INFO L895 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:32:58,977 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:32:58,984 INFO L356 BasicCegarLoop]: Path program histogram: [2] [2022-04-28 10:32:58,986 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:32:58,989 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:32:58,995 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:32:59,037 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:32:59,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:32:59 BoogieIcfgContainer [2022-04-28 10:32:59,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:32:59,046 INFO L158 Benchmark]: Toolchain (without parser) took 1613.47ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 152.1MB in the beginning and 204.9MB in the end (delta: -52.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:32:59,047 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 168.2MB in the beginning and 168.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:32:59,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.35ms. Allocated memory is still 201.3MB. Free memory was 152.0MB in the beginning and 176.5MB in the end (delta: -24.5MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-28 10:32:59,047 INFO L158 Benchmark]: Boogie Preprocessor took 20.85ms. Allocated memory is still 201.3MB. Free memory was 176.5MB in the beginning and 175.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:32:59,048 INFO L158 Benchmark]: RCFGBuilder took 280.75ms. Allocated memory is still 201.3MB. Free memory was 175.0MB in the beginning and 164.9MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 10:32:59,048 INFO L158 Benchmark]: TraceAbstraction took 1104.55ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 164.1MB in the beginning and 204.9MB in the end (delta: -40.9MB). Peak memory consumption was 875.6kB. Max. memory is 8.0GB. [2022-04-28 10:32:59,050 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.13ms. Allocated memory is still 201.3MB. Free memory was 168.2MB in the beginning and 168.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.35ms. Allocated memory is still 201.3MB. Free memory was 152.0MB in the beginning and 176.5MB in the end (delta: -24.5MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.85ms. Allocated memory is still 201.3MB. Free memory was 176.5MB in the beginning and 175.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.75ms. Allocated memory is still 201.3MB. Free memory was 175.0MB in the beginning and 164.9MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1104.55ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 164.1MB in the beginning and 204.9MB in the end (delta: -40.9MB). Peak memory consumption was 875.6kB. 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: 7]: 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 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 13 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 25 PreInvPairs, 33 NumberOfFragments, 220 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 16]: Loop Invariant Derived loop invariant: (y / 4294967296 * 4294967296 + z < y + z / 4294967296 * 4294967296 + 1 && y <= z) && y + z / 4294967296 * 4294967296 <= y / 4294967296 * 4294967296 + z - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: (y / 4294967296 * 4294967296 + z < y + z / 4294967296 * 4294967296 + 1 && y <= z) && y + z / 4294967296 * 4294967296 <= y / 4294967296 * 4294967296 + z - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:32:59,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...