/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/loops/sum03-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:03:26,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:03:26,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:03:26,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:03:26,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:03:26,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:03:26,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:03:26,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:03:26,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:03:26,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:03:26,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:03:26,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:03:26,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:03:26,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:03:26,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:03:26,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:03:26,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:03:26,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:03:26,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:03:26,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:03:26,783 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:03:26,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:03:26,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:03:26,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:03:26,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:03:26,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:03:26,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:03:26,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:03:26,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:03:26,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:03:26,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:03:26,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:03:26,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:03:26,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:03:26,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:03:26,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:03:26,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:03:26,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:03:26,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:03:26,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:03:26,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:03:26,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:03:26,802 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:03:26,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:03:26,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:03:26,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:03:26,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:03:26,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:03:26,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:03:26,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:03:26,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:03:26,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:03:26,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:03:26,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:03:26,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:03:26,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:03:26,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:03:26,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:03:26,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:26,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:03:26,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:03:26,817 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:03:26,817 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:03:26,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:03:26,817 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:03:26,817 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:03:27,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:03:27,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:03:27,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:03:27,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:03:27,149 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:03:27,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-2.i [2022-04-15 12:03:27,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95640ddf4/8323aa8460be4afc9ed12b0279aa2836/FLAG94d183490 [2022-04-15 12:03:27,552 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:03:27,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i [2022-04-15 12:03:27,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95640ddf4/8323aa8460be4afc9ed12b0279aa2836/FLAG94d183490 [2022-04-15 12:03:27,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95640ddf4/8323aa8460be4afc9ed12b0279aa2836 [2022-04-15 12:03:27,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:03:27,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:03:27,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:27,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:03:27,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:03:27,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd4d704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27, skipping insertion in model container [2022-04-15 12:03:27,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:03:27,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:03:27,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i[807,820] [2022-04-15 12:03:27,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:27,742 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:03:27,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i[807,820] [2022-04-15 12:03:27,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:27,767 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:03:27,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27 WrapperNode [2022-04-15 12:03:27,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:27,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:03:27,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:03:27,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:03:27,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:03:27,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:03:27,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:03:27,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:03:27,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (1/1) ... [2022-04-15 12:03:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:27,820 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:03:27,834 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:03:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:03:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:03:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:03:27,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:03:27,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:03:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:03:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:03:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:03:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:03:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:03:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:03:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:03:27,905 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:03:27,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:03:27,998 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:03:28,005 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:03:28,005 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:03:28,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:28 BoogieIcfgContainer [2022-04-15 12:03:28,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:03:28,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:03:28,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:03:28,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:03:28,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:27" (1/3) ... [2022-04-15 12:03:28,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac5bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:28, skipping insertion in model container [2022-04-15 12:03:28,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:27" (2/3) ... [2022-04-15 12:03:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac5bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:28, skipping insertion in model container [2022-04-15 12:03:28,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:28" (3/3) ... [2022-04-15 12:03:28,014 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-2.i [2022-04-15 12:03:28,018 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:03:28,018 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:03:28,054 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:03:28,060 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:03:28,060 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:03:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 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:03:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:03:28,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:28,081 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:28,082 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash -107069111, now seen corresponding path program 1 times [2022-04-15 12:03:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79936984] [2022-04-15 12:03:28,102 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:28,102 INFO L85 PathProgramCache]: Analyzing trace with hash -107069111, now seen corresponding path program 2 times [2022-04-15 12:03:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:28,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356271832] [2022-04-15 12:03:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:28,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:28,644 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(10, 2); {21#true} is VALID [2022-04-15 12:03:28,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:03:28,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #41#return; {21#true} is VALID [2022-04-15 12:03:28,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:28,646 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(10, 2); {21#true} is VALID [2022-04-15 12:03:28,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:03:28,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #41#return; {21#true} is VALID [2022-04-15 12:03:28,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-15 12:03:28,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {26#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 12:03:28,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-15 12:03:28,653 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:28,654 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-15 12:03:28,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:03:28,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:03:28,655 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:03:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356271832] [2022-04-15 12:03:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356271832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:28,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:28,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:03:28,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:28,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79936984] [2022-04-15 12:03:28,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79936984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:28,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:28,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:03:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227482527] [2022-04-15 12:03:28,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:28,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:28,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:28,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:28,683 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:03:28,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:03:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:03:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:03:28,706 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 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 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:29,088 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-15 12:03:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:03:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 12:03:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 12:03:29,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-15 12:03:29,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:29,152 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:03:29,153 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:03:29,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:03:29,158 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:29,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:03:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 12:03:29,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:29,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:29,192 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:29,193 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:29,195 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:03:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:03:29,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:29,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:29,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-04-15 12:03:29,196 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-04-15 12:03:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:29,198 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:03:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:03:29,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:29,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:29,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:29,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 12:03:29,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2022-04-15 12:03:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:29,203 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 12:03:29,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:03:29,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 12:03:29,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:03:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:03:29,229 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:29,229 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:29,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:03:29,230 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1456105815, now seen corresponding path program 1 times [2022-04-15 12:03:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:29,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762950012] [2022-04-15 12:03:31,119 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1811936148, now seen corresponding path program 1 times [2022-04-15 12:03:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:31,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257914106] [2022-04-15 12:03:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:31,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#(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(10, 2); {191#true} is VALID [2022-04-15 12:03:31,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-15 12:03:31,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} #41#return; {191#true} is VALID [2022-04-15 12:03:31,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:31,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#(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(10, 2); {191#true} is VALID [2022-04-15 12:03:31,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-15 12:03:31,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #41#return; {191#true} is VALID [2022-04-15 12:03:31,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-15 12:03:31,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 12:03:31,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} [45] L27-1-->L27_primed: Formula: (or (and (= v_main_~sn~0_In_1 v_main_~sn~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (let ((.cse2 (* v_main_~x~0_Out_2 2)) (.cse0 (* (- 1) v_main_~sn~0_In_1))) (and (<= 0 (div (+ .cse0 v_main_~sn~0_Out_2) 2)) (let ((.cse1 (mod v_main_~sn~0_Out_2 4294967296))) (or (= .cse1 (mod .cse2 4294967296)) (= .cse1 0))) (= (mod (+ v_main_~sn~0_In_1 v_main_~sn~0_Out_2) 2) 0) (= (* |v_main_#t~post3_Out_2| 2) 0) (= (+ (* (- 1) v_main_~sn~0_Out_2) .cse2) (+ .cse0 (* v_main_~x~0_In_1 2)))))) InVars {main_~sn~0=v_main_~sn~0_In_1, main_~x~0=v_main_~x~0_In_1} OutVars{main_#t~post3=|v_main_#t~post3_Out_2|, main_~sn~0=v_main_~sn~0_Out_2, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~sn~0, main_~x~0, main_#t~post3] {197#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-15 12:03:31,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [44] L27_primed-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {198#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) (div (* main_~x~0 2) 4294967296))) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:03:31,357 INFO L272 TraceCheckUtils]: 8: Hoare triple {198#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) (div (* main_~x~0 2) 4294967296))) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {199#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:31,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {200#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:31,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {192#false} is VALID [2022-04-15 12:03:31,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-15 12:03:31,358 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:03:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:31,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257914106] [2022-04-15 12:03:31,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257914106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:31,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:31,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:31,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:31,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762950012] [2022-04-15 12:03:31,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762950012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:31,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:31,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:03:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520049671] [2022-04-15 12:03:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 12:03:31,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:31,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:31,527 WARN L143 InductivityCheck]: Transition 206#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296))) ( _ , assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; , 198#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) (div (* main_~x~0 2) 4294967296))) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1))) ) not inductive [2022-04-15 12:03:31,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:03:31,528 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:03:31,532 INFO L158 Benchmark]: Toolchain (without parser) took 3960.50ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 122.5MB in the beginning and 88.5MB in the end (delta: 34.0MB). Peak memory consumption was 68.8MB. Max. memory is 8.0GB. [2022-04-15 12:03:31,532 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 173.0MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:31,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.93ms. Allocated memory is still 173.0MB. Free memory was 122.3MB in the beginning and 149.7MB in the end (delta: -27.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 12:03:31,533 INFO L158 Benchmark]: Boogie Preprocessor took 22.33ms. Allocated memory is still 173.0MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:31,533 INFO L158 Benchmark]: RCFGBuilder took 215.19ms. Allocated memory is still 173.0MB. Free memory was 148.2MB in the beginning and 138.3MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:03:31,534 INFO L158 Benchmark]: TraceAbstraction took 3521.83ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 137.7MB in the beginning and 88.5MB in the end (delta: 49.2MB). Peak memory consumption was 84.8MB. Max. memory is 8.0GB. [2022-04-15 12:03:31,535 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 173.0MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.93ms. Allocated memory is still 173.0MB. Free memory was 122.3MB in the beginning and 149.7MB in the end (delta: -27.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.33ms. Allocated memory is still 173.0MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 215.19ms. Allocated memory is still 173.0MB. Free memory was 148.2MB in the beginning and 138.3MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3521.83ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 137.7MB in the beginning and 88.5MB in the end (delta: 49.2MB). Peak memory consumption was 84.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:03:31,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...