/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-acceleration/simple_3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:18:01,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:18:01,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:18:01,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:18:01,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:18:01,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:18:01,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:18:01,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:18:01,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:18:01,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:18:01,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:18:01,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:18:01,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:18:01,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:18:01,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:18:01,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:18:01,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:18:01,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:18:01,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:18:01,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:18:01,796 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:18:01,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:18:01,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:18:01,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:18:01,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:18:01,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:18:01,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:18:01,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:18:01,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:18:01,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:18:01,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:18:01,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:18:01,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:18:01,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:18:01,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:18:01,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:18:01,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:18:01,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:18:01,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:18:01,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:18:01,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:18:01,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:18:01,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:18:01,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:18:01,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:18:01,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:18:01,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:18:01,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:18:01,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:18:01,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:18:01,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:18:01,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:18:01,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:18:01,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:18:01,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:18:01,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:18:01,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:18:01,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:18:01,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:01,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:18:01,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:18:01,831 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:18:01,831 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:18:01,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:18:01,831 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:18:01,831 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 12:18:02,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:18:02,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:18:02,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:18:02,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:18:02,073 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:18:02,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-15 12:18:02,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40861e521/b969737bdfe04d0f9ebf558cd62fd023/FLAGf6a3ca55a [2022-04-15 12:18:02,473 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:18:02,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-15 12:18:02,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40861e521/b969737bdfe04d0f9ebf558cd62fd023/FLAGf6a3ca55a [2022-04-15 12:18:02,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40861e521/b969737bdfe04d0f9ebf558cd62fd023 [2022-04-15 12:18:02,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:18:02,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:18:02,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:02,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:18:02,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:18:02,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:02" (1/1) ... [2022-04-15 12:18:02,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56aeab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:02, skipping insertion in model container [2022-04-15 12:18:02,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:02" (1/1) ... [2022-04-15 12:18:02,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:18:02,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:18:03,078 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-acceleration/simple_3-2.c[376,389] [2022-04-15 12:18:03,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:03,098 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:18:03,109 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-acceleration/simple_3-2.c[376,389] [2022-04-15 12:18:03,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:03,122 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:18:03,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03 WrapperNode [2022-04-15 12:18:03,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:03,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:18:03,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:18:03,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:18:03,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:18:03,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:18:03,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:18:03,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:18:03,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (1/1) ... [2022-04-15 12:18:03,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:03,200 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 12:18:03,207 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 12:18:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:18:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:18:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:18:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:18:03,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:18:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:18:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:18:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:18:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:18:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 12:18:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:18:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:18:03,281 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:18:03,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:18:03,357 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:18:03,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:18:03,363 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:18:03,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:03 BoogieIcfgContainer [2022-04-15 12:18:03,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:18:03,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:18:03,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:18:03,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:18:03,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:18:02" (1/3) ... [2022-04-15 12:18:03,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b8d1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:03, skipping insertion in model container [2022-04-15 12:18:03,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:03" (2/3) ... [2022-04-15 12:18:03,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b8d1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:03, skipping insertion in model container [2022-04-15 12:18:03,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:03" (3/3) ... [2022-04-15 12:18:03,382 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_3-2.c [2022-04-15 12:18:03,386 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:18:03,387 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:18:03,426 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:18:03,434 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 12:18:03,434 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:18:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 12:18:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:03,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:03,454 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:03,467 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 1 times [2022-04-15 12:18:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:03,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299962390] [2022-04-15 12:18:03,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 2 times [2022-04-15 12:18:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867108939] [2022-04-15 12:18:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:03,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:03,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:03,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-15 12:18:03,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:03,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:03,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:03,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-15 12:18:03,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-15 12:18:03,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {26#(= main_~x~0 0)} is VALID [2022-04-15 12:18:03,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {26#(= main_~x~0 0)} is VALID [2022-04-15 12:18:03,815 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:03,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:03,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:18:03,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:18:03,817 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 12:18:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:03,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867108939] [2022-04-15 12:18:03,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867108939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:03,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:18:03,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:03,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299962390] [2022-04-15 12:18:03,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299962390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:03,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:03,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:18:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408169083] [2022-04-15 12:18:03,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:03,832 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-15 12:18:03,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:03,836 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-15 12:18:03,863 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-15 12:18:03,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:18:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:18:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:18:03,897 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-15 12:18:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,158 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 12:18:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:18:04,159 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-15 12:18:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:04,160 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-15 12:18:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 12:18:04,167 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-15 12:18:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 12:18:04,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-15 12:18:04,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:04,231 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:18:04,231 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:18:04,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:18:04,236 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:04,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:18:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:18:04,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:04,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,297 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,297 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,299 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:04,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:18:04,300 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:18:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,302 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:04,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:04,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:04,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:18:04,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:18:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:04,305 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:18:04,306 INFO L479 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-15 12:18:04,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:18:04,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:18:04,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:04,324 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:04,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:18:04,325 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 1 times [2022-04-15 12:18:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1618170358] [2022-04-15 12:18:04,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1718302764, now seen corresponding path program 1 times [2022-04-15 12:18:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:04,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969080717] [2022-04-15 12:18:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(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(13, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-04-15 12:18:04,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-15 12:18:04,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #36#return; {166#true} is VALID [2022-04-15 12:18:04,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:04,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(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(13, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-04-15 12:18:04,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-15 12:18:04,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} #36#return; {166#true} is VALID [2022-04-15 12:18:04,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} call #t~ret5 := main(); {166#true} is VALID [2022-04-15 12:18:04,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {171#(= main_~x~0 0)} is VALID [2022-04-15 12:18:04,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(= main_~x~0 0)} [40] L17-2-->L17-3_primed: Formula: (or (and (= (* v_main_~N~0_In_1 2) 0) (< (mod (+ v_main_~x~0_Out_2 4294967294) 4294967296) (mod v_main_~N~0_In_1 65536)) (= (mod (+ v_main_~x~0_Out_2 v_main_~x~0_In_1) 2) 0) (<= 0 (div (+ v_main_~x~0_In_1 (* v_main_~x~0_Out_2 (- 1))) (- 2)))) (and (= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= v_main_~N~0_In_1 v_main_~N~0_In_1))) InVars {main_~x~0=v_main_~x~0_In_1, main_~N~0=v_main_~N~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_~N~0=v_main_~N~0_In_1} AuxVars[] AssignedVars[main_~x~0] {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (not (<= (+ (div main_~x~0 2) 1) 0)))} is VALID [2022-04-15 12:18:04,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (not (<= (+ (div main_~x~0 2) 1) 0)))} [39] L17-3_primed-->L17-3: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~N~0_2 65536))) InVars {main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} AuxVars[] AssignedVars[] {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (not (<= (+ (div main_~x~0 2) 1) 0)))} is VALID [2022-04-15 12:18:04,616 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (not (<= (+ (div main_~x~0 2) 1) 0)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {173#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:04,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {174#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:04,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {167#false} is VALID [2022-04-15 12:18:04,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-15 12:18:04,618 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 12:18:04,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:04,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969080717] [2022-04-15 12:18:04,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969080717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:04,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:04,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:18:04,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:04,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1618170358] [2022-04-15 12:18:04,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1618170358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:04,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:04,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:18:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988404045] [2022-04-15 12:18:04,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-15 12:18:04,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:04,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12:18:04,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:04,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:18:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:18:04,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:18:04,679 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12:18:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,855 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:18:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:18:04,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-15 12:18:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12:18:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-04-15 12:18:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12:18:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-04-15 12:18:04,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 16 transitions. [2022-04-15 12:18:04,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:04,880 INFO L225 Difference]: With dead ends: 15 [2022-04-15 12:18:04,881 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:18:04,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:18:04,886 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:04,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:18:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:18:04,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:04,889 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-15 12:18:04,889 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-15 12:18:04,889 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-15 12:18:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:18:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:18:04,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:04,890 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-15 12:18:04,890 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-15 12:18:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,890 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:18:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:18:04,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:04,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:04,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:04,890 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-15 12:18:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:18:04,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-15 12:18:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:04,891 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:18:04,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12:18:04,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:18:04,891 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-15 12:18:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:18:04,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,894 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:18:04,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:18:04,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:18:04,996 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:18:04,997 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:18:04,999 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:18:05,000 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 22) the Hoare annotation is: true [2022-04-15 12:18:05,000 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 22) the Hoare annotation is: true [2022-04-15 12:18:05,000 INFO L878 garLoopResultBuilder]: At program point L17-2(lines 17 19) the Hoare annotation is: (let ((.cse0 (div main_~x~0 2))) (and (<= main_~x~0 (* .cse0 2)) (not (<= (+ .cse0 1) 0)))) [2022-04-15 12:18:05,001 INFO L878 garLoopResultBuilder]: At program point L17-3(lines 17 19) the Hoare annotation is: (let ((.cse0 (div main_~x~0 2))) (and (<= main_~x~0 (* .cse0 2)) (not (<= (+ .cse0 1) 0)))) [2022-04-15 12:18:05,001 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 22) the Hoare annotation is: true [2022-04-15 12:18:05,001 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:18:05,001 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:18:05,002 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:18:05,002 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:18:05,002 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:18:05,002 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:18:05,002 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:18:05,002 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-15 12:18:05,002 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:18:05,003 INFO L878 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:18:05,003 INFO L878 garLoopResultBuilder]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:18:05,003 INFO L878 garLoopResultBuilder]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:18:05,003 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:18:05,008 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 12:18:05,009 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:18:05,013 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:18:05,016 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:18:05,022 INFO L163 areAnnotationChecker]: CFG has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:18:05,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:18:05 BoogieIcfgContainer [2022-04-15 12:18:05,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:18:05,040 INFO L158 Benchmark]: Toolchain (without parser) took 2115.81ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 131.6MB in the end (delta: 20.7MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2022-04-15 12:18:05,043 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 198.2MB. Free memory was 168.8MB in the beginning and 168.7MB in the end (delta: 90.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:18:05,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.60ms. Allocated memory is still 198.2MB. Free memory was 152.2MB in the beginning and 177.5MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:18:05,044 INFO L158 Benchmark]: Boogie Preprocessor took 36.31ms. Allocated memory is still 198.2MB. Free memory was 177.5MB in the beginning and 176.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:18:05,044 INFO L158 Benchmark]: RCFGBuilder took 204.24ms. Allocated memory is still 198.2MB. Free memory was 176.0MB in the beginning and 166.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:18:05,044 INFO L158 Benchmark]: TraceAbstraction took 1667.12ms. Allocated memory is still 198.2MB. Free memory was 165.7MB in the beginning and 131.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. [2022-04-15 12:18:05,046 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.18ms. Allocated memory is still 198.2MB. Free memory was 168.8MB in the beginning and 168.7MB in the end (delta: 90.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.60ms. Allocated memory is still 198.2MB. Free memory was 152.2MB in the beginning and 177.5MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.31ms. Allocated memory is still 198.2MB. Free memory was 177.5MB in the beginning and 176.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 204.24ms. Allocated memory is still 198.2MB. Free memory was 176.0MB in the beginning and 166.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1667.12ms. Allocated memory is still 198.2MB. Free memory was 165.7MB in the beginning and 131.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.8MB. 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: 8]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 20 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 36 PreInvPairs, 53 NumberOfFragments, 79 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 59 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: 17]: Loop Invariant Derived loop invariant: x <= x / 2 * 2 && !(x / 2 + 1 <= 0) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: 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-15 12:18:05,068 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...