/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:42:46,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:42:46,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:42:46,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:42:46,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:42:46,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:42:46,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:42:46,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:42:46,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:42:46,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:42:46,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:42:46,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:42:46,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:42:46,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:42:46,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:42:46,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:42:46,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:42:46,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:42:46,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:42:46,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:42:46,140 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:42:46,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:42:46,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:42:46,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:42:46,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:42:46,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:42:46,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:42:46,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:42:46,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:42:46,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:42:46,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:42:46,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:42:46,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:42:46,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:42:46,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:42:46,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:42:46,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:42:46,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:42:46,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:42:46,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:42:46,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:42:46,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:42:46,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:42:46,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:42:46,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:42:46,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:42:46,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:42:46,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:42:46,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:42:46,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:42:46,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:42:46,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:42:46,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:42:46,167 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:42:46,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:42:46,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:42:46,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:42:46,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:42:46,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:46,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:42:46,168 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:42:46,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:42:46,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:42:46,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:42:46,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:42:46,389 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:42:46,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-28 02:42:46,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d3008e9/b912b04b0dd5477eb0888f82c0560c27/FLAG366879a9a [2022-04-28 02:42:46,793 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:42:46,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-28 02:42:46,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d3008e9/b912b04b0dd5477eb0888f82c0560c27/FLAG366879a9a [2022-04-28 02:42:46,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d3008e9/b912b04b0dd5477eb0888f82c0560c27 [2022-04-28 02:42:46,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:42:46,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:42:46,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:46,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:42:46,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:42:46,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:46" (1/1) ... [2022-04-28 02:42:46,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7398e067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:46, skipping insertion in model container [2022-04-28 02:42:46,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:46" (1/1) ... [2022-04-28 02:42:46,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:42:46,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:42:47,005 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-1.i[807,820] [2022-04-28 02:42:47,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:47,030 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:42:47,038 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-1.i[807,820] [2022-04-28 02:42:47,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:47,050 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:42:47,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47 WrapperNode [2022-04-28 02:42:47,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:47,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:42:47,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:42:47,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:42:47,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:42:47,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:42:47,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:42:47,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:42:47,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (1/1) ... [2022-04-28 02:42:47,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:47,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:47,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:42:47,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:42:47,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:42:47,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:42:47,167 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:42:47,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:42:47,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:42:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:42:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:42:47,220 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:42:47,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:42:47,300 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:42:47,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:42:47,305 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:42:47,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:47 BoogieIcfgContainer [2022-04-28 02:42:47,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:42:47,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:42:47,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:42:47,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:42:47,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:42:46" (1/3) ... [2022-04-28 02:42:47,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d88b5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:47, skipping insertion in model container [2022-04-28 02:42:47,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:47" (2/3) ... [2022-04-28 02:42:47,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d88b5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:47, skipping insertion in model container [2022-04-28 02:42:47,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:47" (3/3) ... [2022-04-28 02:42:47,347 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2022-04-28 02:42:47,356 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:42:47,356 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:42:47,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:42:47,397 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21c5ccef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ea9006c [2022-04-28 02:42:47,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:42:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:42:47,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:47,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:47,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 1 times [2022-04-28 02:42:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:47,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487505279] [2022-04-28 02:42:47,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 2 times [2022-04-28 02:42:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:47,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137273347] [2022-04-28 02:42:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:47,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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); {23#true} is VALID [2022-04-28 02:42:47,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:47,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-28 02:42:47,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:47,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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); {23#true} is VALID [2022-04-28 02:42:47,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:47,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-28 02:42:47,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-28 02:42:47,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 02:42:47,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 02:42:47,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 02:42:47,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 02:42:47,898 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:47,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:47,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-28 02:42:47,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 02:42:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:47,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137273347] [2022-04-28 02:42:47,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137273347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:47,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:47,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:47,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487505279] [2022-04-28 02:42:47,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487505279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:47,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:47,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554849684] [2022-04-28 02:42:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:47,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-28 02:42:47,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:47,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:47,935 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-28 02:42:47,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:42:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:42:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:42:47,967 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:48,371 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-28 02:42:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:42:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-28 02:42:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 02:42:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 02:42:48,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 02:42:48,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:48,455 INFO L225 Difference]: With dead ends: 41 [2022-04-28 02:42:48,455 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 02:42:48,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:42:48,459 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:48,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 02:42:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-28 02:42:48,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:48,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:42:48,490 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:42:48,490 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:42:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:48,492 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 02:42:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 02:42:48,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:48,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:48,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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 27 states. [2022-04-28 02:42:48,493 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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 27 states. [2022-04-28 02:42:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:48,494 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 02:42:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 02:42:48,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:48,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:48,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:48,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:42:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 02:42:48,507 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-28 02:42:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:48,508 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 02:42:48,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:48,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 02:42:48,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 02:42:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:42:48,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:48,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:42:48,534 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 1 times [2022-04-28 02:42:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:48,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469635157] [2022-04-28 02:42:49,085 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:52,802 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:54,476 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:54,479 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1974113680, now seen corresponding path program 1 times [2022-04-28 02:42:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:54,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108415439] [2022-04-28 02:42:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:54,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 1) .v_it_2.0) (* 4294967296 (div (+ main_~x~0_6 .v_it_2.0) 4294967296)) 10) 0)) [2022-04-28 02:42:54,507 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (let ((.cse1 (* 2 .v_it_2.0))) (= (let ((.cse0 (* 2 main_~x~0_6))) (+ .cse0 .cse1 (* (- 4294967296) (div (+ .cse0 .cse1 2) 4294967296)) 2)) (+ main_~sn~0_6 .cse1 (* (- 4294967296) (div (+ main_~sn~0_6 .cse1 2) 4294967296)) 2))) [2022-04-28 02:42:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:54,554 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 1) .v_it_2.1) (* 4294967296 (div (+ main_~x~0_6 .v_it_2.1) 4294967296)) 10) 0)) [2022-04-28 02:42:54,555 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (let ((.cse1 (* 2 .v_it_2.1))) (= (let ((.cse0 (* 2 main_~x~0_6))) (+ .cse0 .cse1 (* (- 4294967296) (div (+ .cse0 .cse1 2) 4294967296)) 2)) (+ main_~sn~0_6 .cse1 (* (- 4294967296) (div (+ main_~sn~0_6 .cse1 2) 4294967296)) 2))) [2022-04-28 02:42:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:54,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#(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); {232#true} is VALID [2022-04-28 02:42:54,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 02:42:54,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-28 02:42:54,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:54,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(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); {232#true} is VALID [2022-04-28 02:42:54,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 02:42:54,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-28 02:42:54,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-28 02:42:54,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 02:42:54,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L29-1-->L25_primed: Formula: (let ((.cse0 (= (+ v_main_~sn~0_9 2) 0)) (.cse1 (< (mod v_main_~x~0_11 4294967296) 10)) (.cse2 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse3 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse4 (= v_main_~sn~0_9 v_main_~sn~0_8))) (or (and (< v_main_~x~0_10 (+ v_main_~x~0_11 2)) (< v_main_~x~0_11 v_main_~x~0_10) (= v_main_~sn~0_8 0) .cse0 .cse1) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) .cse4) (and .cse2 .cse3 .cse4))) InVars {main_#t~post3=|v_main_#t~post3_4|, main_~sn~0=v_main_~sn~0_9, main_~x~0=v_main_~x~0_11} OutVars{main_#t~post3=|v_main_#t~post3_3|, main_~sn~0=v_main_~sn~0_8, main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[main_~sn~0, main_~x~0, main_#t~post3] {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 02:42:54,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} [53] L25_primed-->L29-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 02:42:54,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} [54] L29-1-->L25_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse5 (= (mod (+ (* v_main_~x~0_11 2) 2) 4294967296) (mod (+ v_main_~sn~0_9 2) 4294967296))) (.cse4 (< (mod v_main_~x~0_11 4294967296) 10)) (.cse1 (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) (.cse2 (= v_main_~sn~0_9 v_main_~sn~0_8))) (or (and .cse0 .cse1 .cse2) (and (= v_main_~sn~0_8 (+ v_main_~sn~0_9 (* v_main_~x~0_11 (- 2)) (* v_main_~x~0_10 2))) (forall ((v_it_2 Int)) (or (and (let ((.cse3 (* v_it_2 2))) (= (mod (+ (* v_main_~x~0_11 2) 2 .cse3) 4294967296) (mod (+ v_main_~sn~0_9 2 .cse3) 4294967296))) (< (mod (+ v_main_~x~0_11 v_it_2) 4294967296) 10)) (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_11 v_it_2 1) v_main_~x~0_10)))) (< v_main_~x~0_11 v_main_~x~0_10) .cse4 .cse5) (and .cse0 (or (not .cse5) (not .cse4)) .cse1 .cse2))) InVars {main_#t~post3=|v_main_#t~post3_7|, main_~sn~0=v_main_~sn~0_9, main_~x~0=v_main_~x~0_11} OutVars{main_#t~post3=|v_main_#t~post3_3|, main_~sn~0=v_main_~sn~0_8, main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[main_~sn~0, main_~x~0, main_#t~post3] {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 02:42:54,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [51] L25_primed-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 02:42:54,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {239#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-28 02:42:54,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {240#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 02:42:54,731 INFO L272 TraceCheckUtils]: 12: Hoare triple {240#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:54,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {241#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {242#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:54,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {233#false} is VALID [2022-04-28 02:42:54,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-28 02:42:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:42:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108415439] [2022-04-28 02:42:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108415439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324373383] [2022-04-28 02:42:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:54,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:54,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:54,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:54,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process